In: de Bakker, J.W.; et al.: Lecture Notes in Computer Science, Vol. 354: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency., pages 549-573. Springer Verlag, 1989.
Abstract: The author extends Park's notion of strong bisimilarity from automata to safe Petri nets. The underlying strong bisimulation is a relation on places which when lifted to the reachable markings preserves their token game and distribution over the places. As a consequence, strongly bisimilar nets have exactly the same concurrent computations as formalised by their casusal nets.