Pages that link to "Item:Q1129263"
From MaRDI portal
The following pages link to Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263):
Displaying 7 items.
- Soundness of workflow nets: classification, decidability, and analysis (Q539433) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- The complexity of some reachability problems for a system on a finite group (Q1262244) (← links)
- Static analysis and stochastic search for reachability problem (Q2229143) (← links)
- On complexity of reachability of transition restricted Petri nets (Q2733997) (← links)
- Free-choice Nets with Home Clusters are Lucent (Q5158668) (← links)