Processes Parametrised by an Algebraic Theory

02/14/2022
by   Todd Schmid, et al.
0

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.

READ FULL TEXT
research
09/01/2022

A (Co)Algebraic Framework for Ordered Processes

A recently published paper (Schmid, Rozowski, Silva, and Rot, 2022) offe...
research
08/21/2023

Algebraic Reasoning About Timeliness

Designing distributed systems to have predictable performance under high...
research
08/07/2023

Abstract Domains for Database Manipulating Processes

Database manipulating systems (DMS) formalize operations on relational d...
research
03/01/2023

Kleene Algebra With Tests for Weighted Programs

Weighted programs generalize probabilistic programs and offer a framewor...
research
09/06/2023

Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements

We investigate the equational theory of Kleene algebra terms with variab...
research
04/06/2022

An Algebraic Approach to Learning and Grounding

We consider the problem of learning the semantics of composite algebraic...
research
02/01/2021

A Brief Account of Klein's Icosahedral Extensions

We present an alternative relatively easy way to understand and determin...

Please sign up or login with your details

Forgot password? Click here to reset