Dataflow semantics for Petri nets

DOI10.1007/3-540-55808-X_26zbMath1493.68246OpenAlexW1598541765MaRDI QIDQ5096839

Robert Gold

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_26

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

A fully abstract semantics for termination in Petri nets

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
• A compositional dataflow semantics for Petri nets

This page was built for publication: Dataflow semantics for Petri nets