Pages that link to "Item:Q685410"
From MaRDI portal
The following pages link to Reachability in cyclic extended free-choice systems (Q685410):
Displaying 7 items.
- Proving nonreachability by modulo-invariants (Q672866) (← links)
- Structure theory of equal conflict systems (Q672877) (← 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)
- Reversible Computation vs. Reversibility in Petri Nets (Q3186587) (← links)
- An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular (Q4633174) (← links)
- A Theory of Distributed Markov Chains (Q4988963) (← links)
