Pages that link to "Item:Q685410"
From MaRDI portal
The following pages link to Reachability in cyclic extended free-choice systems (Q685410):
Displaying 21 items.
- Existence of home states in Petri nets is decidable (Q264201) (← links)
- Reachability determination in acyclic Petri nets by cell enumeration approach (Q644287) (← links)
- Proving nonreachability by modulo-invariants (Q672866) (← links)
- Structure theory of equal conflict systems (Q672877) (← links)
- A sufficient condition for reachability in a general Petri net (Q702167) (← links)
- Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm (Q958302) (← links)
- Normal Petri nets (Q1057065) (← links)
- Priority conflict-free Petri nets (Q1127822) (← links)
- Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263) (← links)
- Blocking a transition in a free choice net and what it tells about its throughput. (Q1401959) (← links)
- Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs (Q1708655) (← links)
- Lower and upper bounds of shortest paths in reachability graphs (Q1777827) (← links)
- An efficient characterization of Petri net solvable binary words (Q2280188) (← links)
- On complexity of reachability of transition restricted Petri nets (Q2733997) (← links)
- Reversible Computation vs. Reversibility in Petri Nets (Q3186587) (← links)
- Enumeration of reachable (forbidden, live and deadlock) states of<i>k</i>th order system of Petri nets (Q3465820) (← links)
- An Algorithm for the General Petri Net Reachability Problem (Q3677184) (← links)
- An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular (Q4633174) (← links)
- Reachability in Petri Nets with Inhibitor Arcs (Q4982097) (← links)
- A Theory of Distributed Markov Chains (Q4988963) (← links)
- Applications and Theory of Petri Nets 2004 (Q5712348) (← links)
