next up previous
Next: Back-and-forth bisimulation Up: Conclusion Previous: Complete axiomatization

Branching congruence has better term rewriting properties than other (abstract) bisimulations.

The axiom system for branching bisimulation can easily be turned in a complete term rewriting system, which is not the case for the other abstract bisimulation semantics. Work in this direction has been done in AKKERMAN & BAETEN (1991) (in the framework of ACP) and DE NICOLA, INVERARDI & NESI (1990) (in the framework of CCS).

Rob van Glabbeek