In: 97: Hildesheimer Informatik-Berichte 9. 1997. Institut fuer Informatik, Universitaet Hildesheim, Germany.; www.iis.nsk.su/persons/itar/.
Abstract: The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets with silent transitions. Basic tau-equivalences and back-forth tau-bisimulation equivalences known from the literature are supplemented by new ones, giving rise to complete set of equivalence notions in interleaving / true concurrency and linear / branching time semantics. Their interrelations are examined for the general class of nets as well as for their subclasses of nets without silent transitions and sequential nets (nets without concurrent transitions). In addition, the preservation of all the equivalence notions by refinements (allowing one to consider the systems to be modelled on a lower abstraction levels) is investigated.
Keywords: Petri nets with silent transitions; sequential nets; basic tau-equivalences; back-forth tau-bisimulation equivalences; refinement.