A fully abstract semantics for termination in Petri nets

DOI10.1007/3-540-58338-6_84zbMath1493.68247OpenAlexW1488278232MaRDI QIDQ5096896

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)

Cites Work

• 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
• Failures semantics and deadlocking of modular Petri nets
• Dataflow semantics for Petri nets
• Unnamed Item
• Unnamed Item

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