A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours
Xinxin Liu, Tingting Yu
Abstract
We present an equational inference system for finite-state expressions, and prove that the system is sound and complete with respect to divergence preserving branching congruence, closing a problem that has been open since 1993. The inference system refines Rob van Glabbeek's simple and elegant complete axiomatisation for branching bisimulation congruence of finite-state behaviours by joining four simple axioms after dropping one axiom which is unsound under the more refined divergence sensitive semantics.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7e85d201-a099-464f-a740-035fe9c44d46Builds on1
Related papers
- Fully Abstract Normal Form Bisimulation for Call-by-Value PCFVasileios Koutavas, Yu-Yang Lin, Nikos TzevelekosLICS 2023 · 8 citations
- Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete: Crystallization: Near-Collapsing Process Graph Interpretations of Regular ExpressionsClemens Armin GrabmayerLICS 2022 · 9 citations
- Graded Monads and Behavioural Equivalence GamesChase Ford, Stefan Milius, Lutz Schröder, Harsh Beohar et al.LICS 2022 · 6 citations
- A Completeness Theorem for Probabilistic Regular ExpressionsWojciech Rozowski, Alexandra SilvaLICS 2024 · 3 citations
- Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program EquivalenceVasileios Koutavas, Yu-Yang Lin, Nikos TzevelekosLICS 2024 · 1 citation
