Branching bisimilarity is an equivalence indeed (1996)
| Venue: | Inform. Process. Lett |
| Citations: | 28 - 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
Bookmark
 |
 |
 |
 |
 |
 |
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).
