Asynchronous communication of Petri Nets and the refinement of transitions

DOI10.1007/3-540-55719-9_108zbMath1425.68303OpenAlexW2138139184MaRDI QIDQ5204351

Walter Vogler

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_108

Mathematics Subject Classification ID

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
• Calculi for synchrony and asynchrony
• Specification-oriented semantics for communicating processes
• Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
• Petri nets with individual tokens
• Failures semantics and deadlocking of modular Petri nets
• A Theory of Communicating Sequential Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asynchronous communication of Petri Nets and the refinement of transitions