A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours
Xinxin Liu, Tingting Yu
2021年份
2被引次数
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper1
相关 Paper
- Fully Abstract Normal Form Bisimulation for Call-by-Value PCFVasileios Koutavas, Yu-Yang Lin, Nikos TzevelekosLICS 2023 · 被引用 8 次
- Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete: Crystallization: Near-Collapsing Process Graph Interpretations of Regular ExpressionsClemens Armin GrabmayerLICS 2022 · 被引用 9 次
- Graded Monads and Behavioural Equivalence GamesChase Ford, Stefan Milius, Lutz Schröder, Harsh Beohar 等LICS 2022 · 被引用 6 次
- A Completeness Theorem for Probabilistic Regular ExpressionsWojciech Rozowski, Alexandra SilvaLICS 2024 · 被引用 3 次
- Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program EquivalenceVasileios Koutavas, Yu-Yang Lin, Nikos TzevelekosLICS 2024 · 被引用 1 次
