Convolution and concurrency

DOI10.1017/S0960129522000081zbMATH Open1490.68139arXiv2002.02321OpenAlexW3004605428MaRDI QIDQ5084483FDOQ5084483

Authors: James Cranch, Simon Doherty, Georg Struth 

Publication date: 24 June 2022

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2002.02321

Recommendations

• Convolution algebras: relational convolution, generalised modalities and incidence algebras
• Convolution as a Unifying Concept
• Concurrent Kleene algebra and its foundations
• Foundations of concurrent Kleene algebra
• Concurrent Kleene Algebra

zbMATH Keywords

quantalesconcurrency theoryKleene algebrasconvolution algebrasrelational monoids

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Noncommutative geometry and reality
• Title not available (Why is that?)
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Graph structure and monadic second-order logic. A language-theoretic approach
• Title not available (Why is that?)
• Boolean Algebras with Operators. Part I
• Handbook of weighted automata
• L-fuzzy sets
• From monoids to hyperstructures: in search of an absolute arithmetic
• Group-like structures in general categories. I. Multiplications and comultiplications
• Varieties of complex algebras
• Concurrency verification. Introduction to compositional and noncompositional methods
• Time, clocks, and the ordering of events in a distributed system
• A class of hyperrings and hyperfields
• Title not available (Why is that?)
• The equational theory of pomsets
• A completeness theorem for Kleene algebras and the algebra of regular events
• The Mathematics of Sentence Structure
• Title not available (Why is that?)
• Title not available (Why is that?)
• Programming and automating mathematics in the Tarski-Kleene hierarchy
• Concurrent Kleene algebra and its foundations
• On multisemigroups.
• Modular construction and partial order semantics of Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• The convolution algebra
• Title not available (Why is that?)
• Axiomatizing the subsumption and subword preorders on finite and infinite partial words
• Languages of higher-dimensional automata
• Expressivity Properties of Boolean BI Through Relational Models
• Title not available (Why is that?)
• Convolution as a Unifying Concept
• Title not available (Why is that?)

Cited In (3)

• Convolutions of weakly sinchronous functions
• Title not available (Why is that?)
• Catoids and modal convolution algebras

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)