In: 97: Hildesheimer Informatik-Berichte 8. 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. Back-forth and place bisimulation equivalences known from the literature are supplemented by new ones, and their relationship with basic behavioural equivalences is examined for the general class of nets as well as for their subclass of sequential nets (nets without concurrent transitions). In addition, the preservation of all the equivalence notions by refinements is investigated to find out which of these equivalences may be used for top-down design.
Keywords: Petri nets; sequential nets; basic equivalences; back-forth bisimulations; place bisimulations; refinement.