Trustworthy Systems

On cool congruence formats for weak bisimulations


Rob van Glabbeek




In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent moves. He proved that weak bisimulation equivalence is a congruence for any process algebra defined by WB cool rules, and established similar results for rooted weak bisimulation (Milner's "observational congruence"), branching bisimulation and rooted branching bisimulation. This study reformulates Bloom's results in a more accessible form and contributes analogues for (rooted) eta-bisimulation and (rooted) delay bisimulation. Moreover, finite equational axiomatisations of rooted weak bisimulation equivalence are provided that are sound and complete for finite processes in any RWB cool process algebra. These require the introduction of auxiliary operators with lookahead, and an extension of Bloom's formats for this type of operator with lookahead. Finally, a challenge is presented for which Bloom's formats fall short and further improvement is called for.

BibTeX Entry

    author           = {van Glabbeek, Robert},
    issn             = {0304-3975},
    journal          = {Theoretical Computer Science},
    keywords         = {concurrency, structural operational semantics, ccs, compositionality, branching bisimulation, weak
                        bisimulation, complete axiomatizations.},
    month            = jun,
    number           = {28},
    pages            = {3283--3302},
    paperurl         = {},
    title            = {On Cool Congruence Formats for Weak Bisimulations},
    volume           = {412},
    year             = {2011}