English

Convolution, Separation and Concurrency

Logic in Computer Science 2014-10-17 v1 Formal Languages and Automata Theory

Abstract

A notion of convolution is presented in the context of formal power series together with lifting constructions characterising algebras of such series, which usually are quantales. A number of examples underpin the universality of these constructions, the most prominent ones being separation logics, where convolution is separating conjunction in an assertion quantale; interval logics, where convolution is the chop operation; and stream interval functions, where convolution is used for analysing the trajectories of dynamical or real-time systems. A Hoare logic is constructed in a generic fashion on the power series quantale, which applies to each of these examples. In many cases, commutative notions of convolution have natural interpretations as concurrency operations.

Keywords

Cite

@article{arxiv.1410.4235,
  title  = {Convolution, Separation and Concurrency},
  author = {Brijesh Dongol and Ian J. Hayes and Georg Struth},
  journal= {arXiv preprint arXiv:1410.4235},
  year   = {2014}
}

Comments

39 pages

R2 v1 2026-06-22T06:25:13.667Z