A Canonical Contraction for Safe Petri Nets

DOI10.1007/978-3-662-45730-6_5zbMath1428.68199OpenAlexW956021246MaRDI QIDQ3452474

Stefan Haar, Thomas Chatain

Publication date: 12 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45730-6_5

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

• Unnamed Item
• Unnamed Item
• Petri nets, event structures and domains. I
• A formal model of atomicity in asynchronous systems
• Vicinity Respecting Homomorphisms for Abstracting System Requirements
• Notes on finite asynchronous automata
• Decentralized Prognosis of Failures in Discrete Event Systems
• Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets
• Building Occurrence Nets from Reveals Relations

This page was built for publication: A Canonical Contraction for Safe Petri Nets