Branching Bisimilarity is an Equivalence Indeed (1996) [31 citations — 3 self]
Download:
|
|
by Twan Basten
Information Processing Letters
http://www.ics.ele.tue.nl/~tbasten/papers/bbe.ps.gz
Add To MetaCart
Abstract:
This note presents a detailed proof of a result in the theory of concurrency semantics that is already considered folklore, namely that branching bisimilarity is an equivalence relation. The "simple proof, " which in the literature is always assumed to exist, is shown to be incorrect. The proof in this note is based on the notion of a semi-branching bisimulation taken from [10]. Branching bisimilarity can equivalently be defined in terms of semi-branching bisimulations; the results suggest that such a definition is more intuitive than the original definition of [9]. Key words: Formal semantics; concurrency theory; branching bisimilarity
Citations
| 241 | The linear time { branching time spectrum II: The semantics of sequential systems with silent moves – Glabbeek - 1993 |
| 203 | Branching time and abstraction in bisimulation semantics – Glabbeek, Weijland - 1996 |
| 92 | Process Algebra, volume 18 of Cambridge Tracts – Baeten, Weijland - 1990 |
| 79 | Three Logics of Branching Bisimulation – Nicola, Vaandrager - 1990 |
| 40 | Structural operational semantics for weak bisimulations – Bloom - 1993 |
| 21 | A complete axiomatization for branching bisimulation congruence of finite-state behaviours – Glabbeek - 1993 |
| 13 | Back and forth bisimulations – Nicola, Montanari, et al. - 1990 |
| 13 | Synchrony and asynchrony in process algebra – Weijland - 1989 |
| 5 | τ-bisimulation and full abstraction for refinement of actions – Cherief, Schnoebelen - 1991 |
| 5 | About semantic action refinement – Degano, Gorrieri - 1991 |
| 2 | A Calculus of Communcating Systems – Milner - 1980 |
| 2 | Synchrony and Asynchrony – Weijland - 1989 |
| 1 | A Calculus of Communcating – Milner |
