A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
From MaRDI portal
Publication:5145655
DOI10.1145/3373718.3394744zbMath1502.68192arXiv2004.12740OpenAlexW3022119532MaRDI QIDQ5145655
Clemens Grabmayer, W. J. Fokkink
Publication date: 21 January 2021
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.12740
Formal languages and automata (68Q45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
Axiomatizing recursion-free, regular monitors ⋮ A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ Unnamed Item
This page was built for publication: A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
