English

Convolution and Concurrency

Logic in Computer Science 2020-02-07 v1

Abstract

We show how concurrent quantales and concurrent Kleene algebras arise as convolution algebras QXQ^X of functions from structures XX with two ternary relations that satisfy relational interchange laws into concurrent quantales or Kleene algebras QQ. The elements of QQ can be understood as weights; the case Q=\boolQ=\bool corresponds to a powerset lifting. We develop a correspondence theory between relational properties in XX and algebraic properties in QQ and QXQ^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 QQ-weighted words, digraphs, posets, isomorphism classes of finite digraphs and pomsets.

Keywords

Cite

@article{arxiv.2002.02321,
  title  = {Convolution and Concurrency},
  author = {James Cranch and Simon Doherty and Georg Struth},
  journal= {arXiv preprint arXiv:2002.02321},
  year   = {2020}
}