A compositional dataflow semantics for Petri nets
From MaRDI portal
Publication:1902302
DOI10.1007/BF01186644zbMath0831.68070OpenAlexW1968942299MaRDI QIDQ1902302
Publication date: 20 November 1995
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01186644
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equational reasoning about nondeterministic processes
- Petri nets with individual tokens
- Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
- Nondeterministic data flow programs: How to avoid the merge anomaly
- Failures semantics and deadlocking of modular Petri nets
This page was built for publication: A compositional dataflow semantics for Petri nets