In: Report TUM-19113. Institut für Informatik, TU München, 1991.
Also in: Information and Computation, Vol. 118, No. 1, pages 38-47. 1995.
Abstract: History preserving bisimilarity and maximality preserving bisimilarity take full account of the interplay between causality and branching, and they are congruences with respect to action refinement for suitable classes of Petri nets. But even for finite safe Petri nets they are based on possibly infinite transition systems, and it is not obvious how to decide them. OM-bisimulation gives a characterization of history preserving bisimulation for safe nets without internal moves, and it allows a decidability result. In this paper we generalize OM-bisimulation and this decidability result to safe nets with internal moves, and also treat the case of maximality preserving bisimulation.
Keywords: Petri nets, action refinements. event structures, concurrent systems, history preserving bisimulation.