Some equivalence notions for concurrent systems. An overview

Structure Theory of Petri Nets: the Free Choice Hiatus

“…L.Pomello has shown that the latter IS a comparatively strong notion of equivalence [36]. Hence we suggest that our notmn of simulation is a comparatively strong one, but we shall not pursue these connections any further in these notes.…”

A foundation for formal reuse of hardware

“…A Transition system for P (TS(P) = {Stsp, Ap, T P, sP}) consists of a set of states Stsp representing the process terms, a set of labels .Ap representing actions, a transition relation T P over process terms which gives the semantics of the system, and an initial state s P. Semantics. A variety of process behavioural equivalences have been defined for deterministic and nondeterministic processes [26,33,34]. In the present work, strong bisimulation [3] is adopted to provide substitutivity of components; reuse requires substitution of processes.…”

Non interleaving process algebra

“…As a set of atomic actions can be performed simultaneously (as a multi-action) this model corresponds to step bisimulation semantics. This notion dates back at least to [NT84], see also [POM86] or [GV87] where it was called concurrent bisimulation.…”