## Branching bisimilarity is an equivalence indeed (1996)

Venue: | Inform. Process. Lett |

Citations: | 37 - 3 self |

### BibTeX

@ARTICLE{Basten96branchingbisimilarity,

author = {Twan Basten},

title = {Branching bisimilarity is an equivalence indeed},

journal = {Inform. Process. Lett},

year = {1996},

pages = {141--147}

}

### Years of Citing Articles

### OpenURL

### Abstract

Communicated by P.M.B. Vitiyi 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 (Van Glabbeek and Weijland, 1991). 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 Van Glabbeek and Weijland ( 1989).

### Citations

1418 | A Calculus of Communicating Systems - Milner - 1980 |

310 | The linear time – branching time spectrum II (The semantics of sequential systems with silent moves
- Glabbeek
- 1993
(Show Context)
Citation Context ...uivalence as introduced by Milner [11]. Since its introduction, branching-bisimulation equivalence has rapidly gained popularity in the scientific literature on concurrency semantics (see for example =-=[1--4,7,8,5,6]-=-). However, the fact that it is indeed an equivalence relation is almost never proven. The only more or less explicit proof appears in [7,10,12]. In the other literature, including the original paper ... |

273 | Branching time and abstraction in bisimulation semantics
- Glabbeek, Weijland
- 1996
(Show Context)
Citation Context ...en 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 1 Introduction In [9], branching bisimilarity has been introduced as an equivalence relation on processes that preserves the b... |

116 |
Three logics for branching bisimulation
- Nicola, Vaandrager
- 1995
(Show Context)
Citation Context ...uivalence as introduced by Milner [11]. Since its introduction, branching-bisimulation equivalence has rapidly gained popularity in the scientific literature on concurrency semantics (see for example =-=[1--4,7,8,5,6]-=-). However, the fact that it is indeed an equivalence relation is almost never proven. The only more or less explicit proof appears in [7,10,12]. In the other literature, including the original paper ... |

96 |
Process Algebra, volume 18 of Cambridge Tracts
- Baeten, Weijland
- 1990
(Show Context)
Citation Context ...as rooted branching bisimilarity, which is also introduced in [9], and (rooted) branching bisimilarity with termination predicates, which is often used in the area of process algebra (See for example =-=[1]-=-). Acknowledgement The author wants to thank Marc Voorhoeve for his helpful suggestions and Rob van Glabbeek for double-checking the counterexample and for his valuable comments on an earlier version ... |

44 | Structural operational semantics for weak bisimulations - Bloom - 1995 |

28 | A complete axiomatization for branching bisimulation congruence of finitestate behaviours
- Glabbeek
- 1993
(Show Context)
Citation Context ...uivalence as introduced by Milner [11]. Since its introduction, branching-bisimulation equivalence has rapidly gained popularity in the scientific literature on concurrency semantics (see for example =-=[1--4,7,8,5,6]-=-). However, the fact that it is indeed an equivalence relation is almost never proven. The only more or less explicit proof appears in [7,10,12]. In the other literature, including the original paper ... |

21 | and forth bisimulations
- Nicola, Montanari, et al.
- 1990
(Show Context)
Citation Context |

16 |
Synchrony and Asynchrony in Process Algebra
- Weijland
- 1989
(Show Context)
Citation Context ...terature on concurrency semantics (see for example [1--4,7,8,5,6]). However, the fact that it is indeed an equivalence relation is almost never proven. The only more or less explicit proof appears in =-=[7,10,12]. In the other liter-=-ature, including the original paper by Van Glabbeek and Weijland, the proof is simply omitted or it is claimed that it is "straightforward" or "easy to see." This note shows that t... |

5 | About semantic action refinement - Degano, Gorrieri - 1991 |

4 | τ-bisimulation and full abstraction for refinement of actions - Cherief, Schnoebelen - 1991 |

4 |
Synchrony and Asynchrony
- Weijland
- 1989
(Show Context)
Citation Context ...iterature on concurrency semantics (see for example [1{4,7,8,5,6]). However, the fact that it is indeed an equivalence relation is almost never proven. The only more or less explicit proof appears in =-=[7,10,12]-=-. In the other literature, including the original paper by Van Glabbeek and Weijland, the proof is simply omitted or it is claimed that it is \straightforward" or \easy to see." This note shows that t... |

2 | A Calculus of Communcating Systems - Milner - 1980 |

1 | A Calculus of Communcating - Milner |

1 | Process Algebra, Cambridge Tracts in Tbcoretical Cornpurer Science 18 - Baeten, Weijland - 1996 |

1 | About semantic action refinement, Fund - Darondeau, Degano - 1991 |