A Characterisation of Weak Bisimulation Congruence

This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation equivalence, even without making assumptions on the cardinality of the sets of states or actions of the processes under consideration.

• Type: Conference
• Year: 2005
• Where: BIRTHDAY
• Authors: Rob J. van Glabbeek
• Keywords: Applied Computing, BIRTHDAY 2005, Weak Bisimulation, Weak Bisimulation Congruence, Weak Bisimulation Equivalence