In: Rovan, B.: Lecture Notes in Computer Science, Vol. 452; Mathematical Foundations of Computer Science 1990; Conference, Banská Bystrica, Czechoslovakia, pages 430-438. Berlin, Germany: Springer-Verlag, 1990.
Abstract: Semi-commutation rewriting systems have been introduced and investigated by Clerbout/Latteux. Starting from those, the notions of semitraces, semi-commutative monoids and an order on those monoids are defined. Behaviours of Petri nets are represented by sets of semitraces. Using that tool, properties of Petri nets, mainly concerning determinism, are discussed. Deterministic Petri nets are characterized in terms of their configurations. The present approach is a generalization of the the Mazurkiewicz's trace model.
Keywords: deterministic net; semi-commutation rewriting system; semi trace; semi commutative monoid.