A compositional partial order semantics for Petri net components
From MaRDI portal
Publication:6487378
Recommendations
Cites work
- scientific article; zbMATH DE number 3926220 (Why is no real title available?)
- scientific article; zbMATH DE number 4092786 (Why is no real title available?)
- scientific article; zbMATH DE number 4108166 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 193318 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- Algebraic characterization of petri net pomset semantics
- Computer science today. Recent trends and developments
- Mutex needs fairness
- Petri net based verification of distributed algorithms: An example
- The non-sequential behaviour of Petri nets
Cited in
(16)- Dataflow semantics for Petri nets
- scientific article; zbMATH DE number 1836392 (Why is no real title available?)
- A fully abstract semantics for termination in Petri nets
- Extensional Petri net
- scientific article; zbMATH DE number 4143457 (Why is no real title available?)
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
- A compositional dataflow semantics for Petri nets
- Composition of software artifacts modelled using colored Petri nets
- A Compositional Petri Net Semantics for SDL
- 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
- scientific article; zbMATH DE number 1696463 (Why is no real title available?)
- scientific article; zbMATH DE number 1799524 (Why is no real title available?)
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)