Separability in persistent Petri nets

MaRDI QIDQ3225713zbMATH OpenFDO

Authors Eike Best, Philippe Darondeau

Publication date 22 March 2012

Full work available at URL http://iospress.metapress.com/content/y6h2520865n66575/fulltext.html

zbMATH Keywords

persistencypersistent Petri netsseparability in Petri nets

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)

Recommendations

• Separability in Conflict-Free Petri Nets
• A Note on Persistent Petri Nets
• Plain, bounded, reversible, persistent, and k-marked Petri nets have marked graph reachability graphs
• Decomposition Theorems for Bounded Persistent Petri Nets
• scientific article; zbMATH DE number 5587264

Cited in

(9)

• Sufficient conditions for the marked graph realisability of labelled transition systems
• On persistency in time Petri nets
• On persistent reachability in Petri nets
• Synthesis and reengineering of persistent systems
• An extension of the taxonomy of persistent and nonviolent steps
• Separability in Conflict-Free Petri Nets
• scientific article; zbMATH DE number 5587264 (Why is no real title available?)
• Separators in Continuous Petri Nets
• Separators in continuous Petri nets

This page was built for publication: Separability in persistent Petri nets

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