Processes Parametrised by an Algebraic Theory
Logic in Computer Science
2022-07-26 v2 Formal Languages and Automata Theory
Abstract
We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic equivalence. We show that there are uniformly defined fragments of our calculi that capture well-known examples from the literature like regular expressions modulo bisimilarity and guarded Kleene algebra with tests. We also derive new calculi for probabilistic and convex processes with an analogue of Kleene star.
Cite
@article{arxiv.2202.06901,
title = {Processes Parametrised by an Algebraic Theory},
author = {Todd Schmid and Wojciech Rozowski and Alexandra Silva and Jurriaan Rot},
journal= {arXiv preprint arXiv:2202.06901},
year = {2022}
}