A compositional partial order semantics for Petri net components
From MaRDI portal
Publication:6487378
DOI10.1007/3-540-63139-9_39zbMATH Open1510.68061MaRDI QIDQ6487378FDOQ6487378
Authors: Ekkart Kindler 
Publication date: 9 December 2022
Recommendations
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer science today. Recent trends and developments
- Mutex needs fairness
- The non-sequential behaviour of Petri nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic characterization of petri net pomset semantics
- Petri net based verification of distributed algorithms: An example
- Title not available (Why is that?)
Cited In (16)
- Dataflow semantics for Petri nets
- Title not available (Why is that?)
- A fully abstract semantics for termination in Petri nets
- Extensional Petri net
- Title not available (Why is that?)
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
- A compositional dataflow semantics for Petri nets
- A Compositional Petri Net Semantics for SDL
- Composition of software artifacts modelled using colored Petri nets
- Modal Open Petri Nets
- Operational semantics for Petri net components
- Open Petri Nets: Non-deterministic Processes and Compositionality
- ITL semantics of composite Petri nets
- Petri net reactive modules
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A compositional partial order semantics for Petri net components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487378)
