Branching Bisimilarity with Explicit Divergence

Authors:
Rob van Glabbeek;Bas Luttik;Nikola Trčka
Affiliations:
National ICT Australia, Sydney, Australia. School of Computer Science and Engineering, University of New South Wales, Sydney, Australia. rvg@cs.stanford.edu;(Correspd.) Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands. CWI, The Netherlands. s.p.luttik@tue.nl;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands. n.trcka@tue.nl
Venue:
Fundamenta Informaticae
Year:
2009

Citing 7
Cited 6

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Three logics for branching bisimulation

Journal of the ACM (JACM)
Translations between modal logics of reactive systems

AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Branching bisimilarity is an equivalence indeed!

Information Processing Letters
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
A partial order approach to branching time logic model checking

Information and Computation
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory

Folk theorems on the correspondence between state-based and event-based systems

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Property-dependent reductions for the modal Mu-calculus

Proceedings of the 18th international SPIN conference on Model checking software
Reactive turing machines

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Turing meets milner

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Efficient property preservation checking of model refinements

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Reactive Turing machines

Information and Computation

Quantified Score

Hi-index	0.02

Visualization

Abstract

We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with until- and divergence modalities.