Decomposition Theorems for Bounded Persistent Petri Nets

DOI10.1007/978-3-540-68746-7_7MaRDI QIDQ3510855zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A Note on Persistent Petri Nets
• A decomposition theorem for finite persistent transition systems
• scientific article; zbMATH DE number 5587264
• Union decomposition of Petri net
• Reachability in cyclic extended free-choice systems

Cites work

• Concurrent transition systems
• Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
• Free Choice Petri Nets
• scientific article; zbMATH DE number 3471613 (Why is no real title available?)
• Making Petri nets safe and free of internal transitions
• Marked directed graphs
• On weak persistency of Petri nets
• Properties of Conflict-Free and Persistent Petri Nets
• Separability in Conflict-Free Petri Nets
• The decidability of persistence for vector addition systems

Cited in

(9)

• A decomposition theorem for finite persistent transition systems
• On structural conditions for weak persistency and semilinearity of Petri nets
• Homothecy, bifurcations, continuity and monotonicity in timed continuous Petri nets under infinite server semantics
• Separability in persistent Petri nets
• PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
• A Note on Persistent Petri Nets
• scientific article; zbMATH DE number 1405652 (Why is no real title available?)
• On the reversibility of well-behaved weighted choice-free systems
• Step persistence in the design of GALS systems

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

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