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 with new ones, and their relationships with basic behavioural equivalence relations are examined for the whole class of Petri nets as well as for the subclass of sequential nets. In addition, the preservation of all the equivalence notions by refinements is treated.
File
tarasyuk.pdf8.72 MB
Pages
57-84