Solving liveness problem for marked nets by exhaustive coverability trees
From MaRDI portal
Recommendations
- Efficient algorithms for three reachability problems in safe Petri nets
- scientific article; zbMATH DE number 3982527
- On the Efficient Computation of the Minimal Coverability Set for Petri Nets
- On the efficient computation of the minimal coverability set of Petri nets
- Macro liveness graph and liveness of -independent unbounded nets
This page was built for publication: Solving liveness problem for marked nets by exhaustive coverability trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004340)