Decomposition Theorems for Bounded Persistent Petri Nets

DOI10.1007/978-3-540-68746-7_7zbMath1143.68473OpenAlexW1533935241MaRDI QIDQ3510855

Eike Best, Philippe Darondeau

Publication date: 3 July 2008

Published in: Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68746-7_7

Mathematics Subject Classification ID

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

Related Items (3)

Step Persistence in the Design of GALS Systems ⋮ A Note on Persistent Petri Nets ⋮ On the Reversibility of Well-Behaved Weighted Choice-Free Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
• Concurrent transition systems
• The decidability of persistence for vector addition systems
• On weak persistency of Petri nets
• Marked directed graphs
• Separability in Conflict-Free Petri Nets
• Properties of Conflict-Free and Persistent Petri Nets
• Free Choice Petri Nets

This page was built for publication: Decomposition Theorems for Bounded Persistent Petri Nets