Separability in Conflict-Free Petri Nets

DOI10.1007/978-3-540-70881-0_1zbMATH Open1185.68438OpenAlexW1543155041MaRDI QIDQ3401931FDOQ3401931

Authors: Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf 

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

Recommendations

• Separability in Persistent Petri Nets
• Separability in persistent Petri nets
• Priority conflict-free Petri nets
• Concurrency, Synchronization, and Conflicts in Petri Nets
• Concurrent bisimulations in Petri nets
• scientific article; zbMATH DE number 1554174
• A valuation-based analysis of conflict-free Petri nets
• Decomposition of Petri nets
• Compositional reachability in Petri nets
• Deciding a class of path formulas for conflict-free Petri nets

Mathematics Subject Classification ID

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

Cited In (7)

• A decomposition theorem for finite persistent transition systems
• A valuation-based analysis of conflict-free Petri nets
• A Note on Persistent Petri Nets
• Decomposition Theorems for Bounded Persistent Petri Nets
• Sufficient conditions for the marked graph realisability of labelled transition systems
• Separability in persistent Petri nets
• Concurrency, Synchronization, and Conflicts in Petri Nets

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

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