Pages that link to "Item:Q2117182"
From MaRDI portal
The following pages link to Efficient algorithms for three reachability problems in safe Petri nets (Q2117182):
Displaying 9 items.
- Complexity results for 1-safe nets (Q672459) (← links)
- Accelerating the computation of dead and concurrent places using reductions (Q832013) (← links)
- Solving liveness problem for marked nets by exhaustive coverability trees (Q1004340) (← links)
- Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263) (← links)
- Unfolding based alorithms for the reachability problem (Q2775861) (← links)
- Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE (Q2920142) (← links)
- Efficient computerized Petri net approach for the enumeration of the sets of path identifiers for reliability analysis of broadcasting networks (Q3479787) (← links)
- Applications and Theory of Petri Nets 2004 (Q5712340) (← links)
- Occam's razor applied to the Petri net coverability problem (Q5915567) (← links)