A uniform approach to true-concurrency and interleaving semantics for Petri nets

DOI10.1016/S0304-3975(97)00169-2zbMath0917.68159MaRDI QIDQ1274975

Harro Wimmel, Lutz Priese

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Petri netscompositional semanticsinterleaving and true-concurrency models

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Operational semantics for Petri net components ⋮ Algebraic characterization of petri net pomset semantics ⋮ Open Petri Nets: Non-deterministic Processes and Compositionality ⋮ Extensional Petri net

Cites Work

• Automata and concurrency
• A distributed operational semantics of CCS based on condition/event systems
• Four domains for concurrency
• Remarks on blind and partially blind one-way multicounter machines
• Algebraic characterization of petri net pomset semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item