Semi-commutation and deterministic petri nets
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 well-known Mazurkiewicz's  trace model.
KeywordsConcurrent System Firing Sequence Fireable Cycle Transition Capacity Concurrent State
Unable to display preview. Download preview PDF.
- M.Clerbout/M.Latteux: Semi-Commutations; Information and Computation 73, 1987.Google Scholar
- H.Genrich/E.Stankiewicz-Wiechno: A Dictionary of Some Basic Notions of Net Theory; LNCS 84, 1980.Google Scholar
- U.Goltz/W.Reisig: The Non-Sequential Behaviour of Petri Nets; Information and Control 57, 1983.Google Scholar
- U.Grude: Concurrency for P/T-Nets; Petri Net Newsletter 31, December 1988.Google Scholar
- D.V.Hung/E.Knuth: Semi-Commutations and Petri Nets; Theoretical Computer Science 64.1, 1989.Google Scholar
- A.Mazurkiewicz: Complete Processes and Inevitability; Report 86-06, University of Leiden 1986.Google Scholar
- A.Mazurkiewicz: Trace Theory; Adv. Course on Petri Nets 86, LNCS 255, 1987.Google Scholar
- A.Mazurkiewicz: Concurrency, Compositionality and Synchronization; Proc. of MFCS 89, LNCS 379, 1989.Google Scholar
- A.Mazurkiewicz/E.Ochmanski/W.Penczek: Concurrent Systems and Inevitability; Theoretical Computer Science 64.3, 1989.Google Scholar
- E.Ochmański: Semi-Commutation for Place/Transition Systems; Bulletin of EATCS 38, June 1989.Google Scholar
- E.Ochmański/W.Penczek: Inevitability in Diamond Processes; Informatique Theorique et Applications 24.1, 1990.Google Scholar
- G.Rozenberg: Behaviour of Elementary Net Systems; Adv. Course on Petri Nets 86, LNCS 254, 1987.Google Scholar