In: Report TUM--I--9002; Proccedings of the Conference on Free Partially Commutative Monoids, 1989, Kochel am See, Germany, pages 151-166. München, Germany: Technische Universiät, Institut für Informatik, January 1990.
Abstract: Starting from a semi-commutation system, the author defines the notions of semitraces, semi-commutative monoid and an order on that monoid. Concurrent systems and processes are modelled as some subsets of semi-commutative monoids; it is done in the framework of the general Mazurkiewicz's concept. The model of concurrency proposed here, based on semitraces, is a generalization of the well-known Mazurkiewicz's model, based on traces. It allows one to represent behaviours of Place/Transition systems by sets of semitraces, like sets of traces (trace languages) represent behaviours of Elementary Net systems.
Keywords: semi-commutation rewriting system; semi-trace; semi-commutative monoid; Mazurkiewicz's model; place/transition system; trace language; elementary net system.