Separability in Conflict-Free Petri Nets

DOI10.1007/978-3-540-70881-0_1zbMath1185.68438OpenAlexW1543155041MaRDI QIDQ3401931

Eike Best, Javier Esparza, Harro Wimmel, Karsten Schmidt

Publication date: 2 February 2010

Published in: Perspectives of Systems Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70881-0_1

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Sufficient conditions for the marked graph realisability of labelled transition systems ⋮ A Note on Persistent Petri Nets ⋮ Decomposition Theorems for Bounded Persistent Petri Nets ⋮ Concurrency, Synchronization, and Conflicts in Petri Nets ⋮ A decomposition theorem for finite persistent transition systems

This page was built for publication: Separability in Conflict-Free Petri Nets