On cool congruence formats for weak bisimulations

  • Authors:

  • Rob Jan van Glabbeek

  • Affiliations:

  • National ICT Australia and School of Computer Science and Engineering, The University of New South Wales

  • Venue:
  • ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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) η-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. Finally, a challenge is presented for which Bloom’s formats fall short and further improvement is called for.