A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science S. 1 - 13
Hauptverfasser: Liu, Xinxin, Yu, Tingting
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 29.06.2021
Schlagworte:
Computer science
Semantics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/LICS52264.2021.9470647