A General Completeness Theorem for Skip-Free Star Algebras

Lecture notes in computer science, pp. 265–286

Abstract

Abstract We consider process algebras with branching parametrized by an equational theory $$\textsf{T}$$ T , and show that it is possible to axiomatize bisimilarity under certain conditions on $$\textsf{T}$$ T . Our proof abstracts an earlier argument due to Grabmayer and Fokkink (LICS’20), and yields new completeness theorems for skip-free process algebras with probabilistic (guarded) branching, while also covering existing completeness results.

Authors 2

1. Tobias Kappé Aachen

   Leiden University

   Affiliation as printed

   LIACS, Leiden University, Leiden, The Netherlands

2. Todd Schmid corresponding

   Bucknell University

   Affiliation as printed

   Bucknell University, Lewisburg, USA