A Complete Axiom System for 1-Free Kleene Star Expressions under Bisimilarity: An Elementary Proof
Logic in Computer Science
2021-11-23 v1
Abstract
Grabmayer and Fokkink recently presented a finite and complete axiomatization for 1-free process terms over the binary Kleene star under bismilarity equivalence (proceedings of LICS 2020, preprint available). A different and considerably simpler proof is detailed in this paper. This result, albeit still somewhat technical, only relies on induction and normal forms and is therefore also much closer to a potential rewriting algorithm. In addition, a complete verification in the Coq proof assistant of all results in this work is provided, but correctness does not depend upon any computer-assisted methodology.
Keywords
Cite
@article{arxiv.2111.11144,
title = {A Complete Axiom System for 1-Free Kleene Star Expressions under Bisimilarity: An Elementary Proof},
author = {Allan van Hulst},
journal= {arXiv preprint arXiv:2111.11144},
year = {2021}
}
Comments
15 pages, for Coq-proofs contact the author