Convolution and concurrency

Algebraic theory of languages and automata (68Q70) Other algebras related to logic (03G25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Quantales (06F07)

Abstract: We show how concurrent quantales and concurrent Kleene algebras arise as convolution algebras

Q^{X}

of functions from structures

X

with two ternary relations that satisfy relational interchange laws into concurrent quantales or Kleene algebras

Q

. The elements of

Q

can be understood as weights; the case

corresponds to a powerset lifting. We develop a correspondence theory between relational properties in

X

and algebraic properties in

Q

and

Q^{X}

in the sense of modal and substructural logics, and boolean algebras with operators. As examples, we construct the concurrent quantales and Kleene algebras of

Q

-weighted words, digraphs, posets, isomorphism classes of finite digraphs and pomsets.

Recommendations

Cites work

Cited in

(4)

Describes a project that uses

Uses Software

Archive Formal Proofs

This page was built for publication: Convolution and concurrency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084483)