Pages that link to "Item:Q1193656"
From MaRDI portal
The following pages link to A polynomial-time algorithm to decide liveness of bounded free choice nets (Q1193656):
Displaying 8 items.
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- Structure theory of equal conflict systems (Q672877) (← links)
- Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263) (← links)
- Polynomial-time optimal liveness enforcement for guidepath-based transport systems (Q2665316) (← links)
- On liveness and controlled siphons in Petri nets (Q4633154) (← links)
- On liveness in Extended Non Self-Controlling Nets (Q5096358) (← links)
- Notes on liveness and boundedness of extended strong asymmetric choice nets. II (Q5959363) (← links)