Executions: A new partial-order semantics of Petri nets

DOI10.1016/0304-3975(91)90084-FzbMath0756.68076OpenAlexW2080705820MaRDI QIDQ1183595

Walter Vogler

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90084-f

zbMATH Keywords

Petri netspartial order semanticsconcurrency

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 (7)

Process semantics of general inhibitor nets ⋮ Abstract processes of place/transition systems ⋮ Branching Processes of General Petri Nets ⋮ Towards reasoning about Petri nets: a propositional dynamic logic based approach ⋮ Abstract processes and conflicts in place/transition systems ⋮ On Causal Semantics of Petri Nets ⋮ Modal algebra and Petri nets

Cites Work

• Concurrent and maximally concurrent evolution of nonsequential systems
• Modeling concurrency with partial orders
• Theory of traces
• Sequential and concurrent behaviour in Petri net theory
• The non-sequential behaviour of Petri nets
• Concurrent Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Executions: A new partial-order semantics of Petri nets