Macro liveness graph and liveness of -independent unbounded nets
From MaRDI portal
(Redirected from Publication:893846)
Macro liveness graph and liveness of \(\omega\)-independent unbounded nets
Macro liveness graph and liveness of \(\omega\)-independent unbounded nets
Recommendations
Cites work
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- A large-update predictor-correcting algorithm for linear complementarity problem
- An Algorithm for the General Petri Net Reachability Problem
- Complexity of some problems in Petri nets
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Mathematical programming approach to the Petri nets reachability problem
- Parallel program schemata
- Polynomial-time verification of diagnosability of fuzzy discrete event systems
Cited in
(5)- Solving liveness problem for marked nets by exhaustive coverability trees
- scientific article; zbMATH DE number 3872693 (Why is no real title available?)
- scientific article; zbMATH DE number 1696458 (Why is no real title available?)
- Synthesis of Petri net supervisors for FMS via redundant constraint elimination
- Model checking Petri nets with MSVL
This page was built for publication: Macro liveness graph and liveness of \(\omega\)-independent unbounded nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893846)