@article{Basten1996141,
    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 (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).},
    Author = {Basten, Twan},
    File = {Branching bisimilarity is an equivalence indeed! - Basten (0) (0) - a - a - g.pdf},
    ISSN = {0020-0190},
    Journal = {Information Processing Letters},
    Keywords = {Branching bisimilarity},
    Number = {3},
    Pages = {141 - 147},
    Title = {Branching bisimilarity is an equivalence indeed!},
    URL = {http://www.sciencedirect.com/science/article/pii/0020019096000348},
    Volume = {58},
    Year = {1996},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/0020019096000348},
    bdsk-url-2 = {http://dx.doi.org/10.1016/0020-0190(96)00034-8},
    date-added = {2016-03-26 13:18:19 +0000},
    date-modified = {2016-03-26 13:18:19 +0000},
    file-2 = {Branching bisimilarity is an equivalence indeed! - Basten (1) (0) - a - a - g.pdf},
    doi = {10.1016/0020-0190(96)00034-8}
}

@article{Basten1996141, 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 (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).}, Author = {Basten, Twan}, File = {Branching bisimilarity is an equivalence indeed! - Basten (0) (0) - a - a - g.pdf}, ISSN = {0020-0190}, Journal = {Information Processing Letters}, Keywords = {Branching bisimilarity}, Number = {3}, Pages = {141 - 147}, Title = {Branching bisimilarity is an equivalence indeed!}, URL = {http://www.sciencedirect.com/science/article/pii/0020019096000348}, Volume = {58}, Year = {1996}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/0020019096000348}, bdsk-url-2 = {http://dx.doi.org/10.1016/0020-0190(96)00034-8}, date-added = {2016-03-26 13:18:19 +0000}, date-modified = {2016-03-26 13:18:19 +0000}, file-2 = {Branching bisimilarity is an equivalence indeed! - Basten (1) (0) - a - a - g.pdf}, doi = {10.1016/0020-0190(96)00034-8} }