A General Completeness Theorem for Skip-free Star Algebras
Logic in Computer Science
2025-01-28 v1
Abstract
We consider process algebras with branching parametrized by an equational theory T, and show that it is possible to axiomatize bisimilarity under certain conditions on 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.
Keywords
Cite
@article{arxiv.2501.15325,
title = {A General Completeness Theorem for Skip-free Star Algebras},
author = {Tobias Kappé and Todd Schmid},
journal= {arXiv preprint arXiv:2501.15325},
year = {2025}
}