In: Joint Novosibirsk Computing Center and Institute of Informatics Systems Bulletin, Series Computer Science 12, pages 47-51. 1999. Novosibirsk, Russia. Proceedings of 3rd INPRIM'98, Novosibirsk, June 22-27, 1998.; www.iis.nsk.su/persons/itar/.
Abstract: The paper is devoted to the investigation of behavioural equivalences for Petri nets with silent transitions (tau-equivalences). Basic tau-equivalences and back-forth tau-bisimulation equivalences are supplemented by new ones, giving rise to the complete set of equivalence notions in interleaving / true concurrency and linear / branching time semantics. Their interrelations are examined for the general Petri nets with silent transitions as well as for the subclass of sequential nets. In addition, the preservation of all the equivalence notions by refinements is investigated.
Keywords: Petri nets; silent transitions; behavioural equivalences; refinement; sequential nets.