A fully abstract semantics for termination in Petri nets

DOI10.1007/3-540-58338-6_84MaRDI QIDQ5096896zbMATH OpenOpenAlexFDO

Authors Robert Gold

Publication date 18 August 2022

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

Full work available at URL https://doi.org/10.1007/3-540-58338-6_84

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)

Recommendations

• A compositional dataflow semantics for Petri nets
• Dataflow semantics for Petri nets
• scientific article; zbMATH DE number 3974312
• A compositional partial order semantics for Petri net components
• scientific article; zbMATH DE number 4143457

Cites work

• Dataflow semantics for Petri nets
• Failures semantics and deadlocking of modular Petri nets
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 149517 (Why is no real title available?)
• Modular construction and partial order semantics of Petri nets
• 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

Cited in

(1)

• scientific article; zbMATH DE number 5506906 (Why is no real title available?)

This page was built for publication: A fully abstract semantics for termination in Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096896)