James Cranch

dblp:131/6909 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2021 Convolution and concurrency
abstract
Abstract We show how concurrent quantales and concurrent Kleene algebras arise as convolution algebras of functions from relational structures with two ternary relations that satisfy relational interchange laws into concurrent quantales or Kleene algebras, among others. The elements of the quantales can be understood as weights; the case where weights are drawn from the booleans corresponds to languages. We develop a correspondence theory between properties of the relational structures and algebraic properties in the weight and convolution algebras in the sense of modal and substructural logics, or boolean algebras with operators. The resulting correspondence triangles yield in particular general construction principles for models of concurrent quantales and Kleene algebras as convolution algebras from much simpler relational structures, including weighted ones for quantitative applications. As examples, we construct the concurrent quantales and Kleene algebras of weighted words, digraphs, posets, isomorphism classes of finite digraphs and pomsets.
James Cranch, Simon Doherty, Georg Struth
Math. Struct. Comput. Sci.1
2013 Strength of the Reversible, Garbage-Free 2 k ±1 Multiplier
Eva Rotenberg, James Cranch, Michael Kirkedal Thomsen, Holger Bock Axelsen
RC2