Abstract
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature are supplemented by new ones, and their relationship with basic behavioural equivalences is examined for the whole class of Petri nets as well as for their subclass of sequential nets. In addition, the preservation of all the equivalence notions by refinements is examined.
Cite
CITATION STYLE
Tarasyuk, I. V. (1997). Back-forth equivalences for design of concurrent systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1234, pp. 374–384). Springer Verlag. https://doi.org/10.1007/3-540-63045-7_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
