In: Lecture Notes in Computer Science, Vol. 259: Computer Applications and Cybernetics, pages 224-242. Springer-Verlag, 1987.
Abstract: The issue of interleaving semantics versus True concurrency is discussed in an algebraic setting. Various equivalence notions of Petri nets are presented which can be used in the construction of algebraic models: The occurrence net equivalence, the bisimulation equivalence, the concurrent bisimulation equivalence, and partial order equivalences. It is shown that, besides occurrence net equivalence, none of the equivalences mentioned above is real-time consistent. Therefore we introduce the notion of ST-bisimulation equivalence, which is real-time consistent.
Back to the Petri Nets Bibliography