Convolution and concurrency
From MaRDI portal
Publication:5084483
DOI10.1017/S0960129522000081zbMath1490.68139arXiv2002.02321OpenAlexW3004605428MaRDI QIDQ5084483
Georg Struth, James Cranch, Simon Doherty
Publication date: 24 June 2022
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.02321
Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Other algebras related to logic (03G25) Quantales (06F07)
Related Items
Uses Software
Cites Work
- Modular construction and partial order semantics of Petri nets
- Programming and automating mathematics in the Tarski-Kleene hierarchy
- Concurrent Kleene algebra and its foundations
- Group-like structures in general categories. I. Multiplications and comultiplications
- Handbook of weighted automata
- A class of hyperrings and hyperfields
- The equational theory of pomsets
- A completeness theorem for Kleene algebras and the algebra of regular events
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- The convolution algebra
- On multisemigroups.
- L-fuzzy sets
- Varieties of complex algebras
- From monoids to hyperstructures: in search of an absolute arithmetic
- The Mathematics of Sentence Structure
- Time, clocks, and the ordering of events in a distributed system
- Noncommutative geometry and reality
- Languages of higher-dimensional automata
- Convolution as a Unifying Concept
- Expressivity Properties of Boolean BI Through Relational Models
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Boolean Algebras with Operators. Part I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
