A Note on Persistent Petri Nets
From MaRDI portal
Recommendations
- Decomposition Theorems for Bounded Persistent Petri Nets
- On persistent reachability in Petri nets
- Plain, bounded, reversible, persistent, and k-marked Petri nets have marked graph reachability graphs
- On structural conditions for weak persistency and semilinearity of Petri nets
- scientific article; zbMATH DE number 5587264
Cites work
- Decomposition Theorems for Bounded 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
- Properties of Conflict-Free and Persistent Petri Nets
- Separability in Conflict-Free Petri Nets
Cited in
(14)- On structural conditions for weak persistency and semilinearity of Petri nets
- On persistency in time Petri nets
- Plain, bounded, reversible, persistent, and k-marked Petri nets have marked graph reachability graphs
- On persistent reachability in Petri nets
- Markings in perpetual free-choice nets are fully characterized by their enabled transitions
- Separability in persistent Petri nets
- Decomposition Theorems for Bounded Persistent Petri Nets
- scientific article; zbMATH DE number 176140 (Why is no real title available?)
- Event structures for Petri nets with persistence
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
- scientific article; zbMATH DE number 5587264 (Why is no real title available?)
- Levels of persistency in place/transition nets
- A taxonomy of persistent and nonviolent steps
- Linear time analysis of properties of conflict-free and general Petri nets
This page was built for publication: A Note on Persistent Petri Nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507378)
