A compositional partial order semantics for Petri net components

DOI10.1007/3-540-63139-9_39zbMath1510.68061MaRDI QIDQ6487378

Ekkart Kindler

Publication date: 9 December 2022

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

Operational semantics for Petri net components ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ Modal Open Petri Nets ⋮ Open Petri Nets: Non-deterministic Processes and Compositionality ⋮ Extensional Petri net ⋮ Petri net reactive modules

Cites Work

• Mutex needs fairness
• Petri net based verification of distributed algorithms: An example
• Computer science today. Recent trends and developments
• The non-sequential behaviour of Petri nets
• Algebraic characterization of petri net pomset semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A compositional partial order semantics for Petri net components