Macro liveness graph and liveness of \(\omega\)-independent unbounded nets
From MaRDI portal
Publication:893846
DOI10.1007/s11432-014-5239-9zbMath1331.93148OpenAlexW2182981651MaRDI QIDQ893846
Mengdi Gan, Meng Chu Zhou, ShouGuang Wang
Publication date: 20 November 2015
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-014-5239-9
Applications of graph theory (05C90) Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03)
Related Items
Synthesis of Petri net supervisors for FMS via redundant constraint elimination ⋮ Model checking Petri nets with MSVL
Cites Work
- Unnamed Item
- Unnamed Item
- Mathematical programming approach to the Petri nets reachability problem
- Polynomial-time verification of diagnosability of fuzzy discrete event systems
- Complexity of some problems in Petri nets
- Parallel program schemata
- An Algorithm for the General Petri Net Reachability Problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems