Abstract

ion is usually performed by turning actions that are considered unimportant into the invisible action ø . Then, a system that after some activity reaches a state from which only an invisible action is possible, leading to another state, is considered equivalent to an otherwise identical system, that after said activity immediately reaches the other state. Thus the mechanism of abstraction by hiding of irrelevant or unobservable actions needs support from the congruence notion employed. There are many ways to extend bisimulation congruence to processes with hidden moves. The simplest generalization is strong (bisimulation) equivalence, in which ø-actions are treated no different than visible actions. For this reason strong congruence is not abstract in the sense stipulated above. Another option is to take the testing scenario underlying bisimulation equivalence as primary, incorporating the unobservable nature of hidden moves. This yields Milner's notion of weak (bisimulation) congruenc...

Citations

259	The Linear Time-Branching Time Spectrum - Glabbeek - 1990
223	Branching Time and Abstraction in Bisimulation Semantics - Glabbeek, Weijland - 1996
207	1985], ‘Algebra of communicating processes with abstraction’, Theoretical Computer Science 37 - Bergstra, Klop
121	A complete inference system for a class of regular behaviours - Milner - 1984
118	Operational and algebraic semantics of concurrent processes - Milner - 1990
53	A complete axiomatisation for observational congruence of finite-state behaviours - Milner - 1989
45	Bisimulation and divergence - Walker - 1990
25	A complete inference system for regular processes with silent moves - Bergstra, Klop - 1986