Macro liveness graph and liveness of -independent unbounded nets

DOI10.1007/S11432-014-5239-9zbMATH Open1331.93148OpenAlexW2182981651MaRDI QIDQ893846FDOQ893846

Authors: Mengdi Gan, ShouGuang Wang, MengChu Zhou 

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

Recommendations

• scientific article; zbMATH DE number 1696458
• scientific article; zbMATH DE number 3982527
• Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
• On liveness in extended non self-controlling nets
• Deciding Structural Liveness of Petri Nets

zbMATH Keywords

complex systemsPetri netslivenessdiscrete event system (DES)property analysis

Mathematics Subject Classification ID

Applications of graph theory (05C90) Attainable sets, reachability (93B03) Discrete event control/observation systems (93C65)

Cites Work

• Parallel program schemata
• Title not available (Why is that?)
• 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
• A large-update predictor-correcting algorithm for linear complementarity problem
• Polynomial-time verification of diagnosability of fuzzy discrete event systems

Cited In (5)

• Title not available (Why is that?)
• Solving liveness problem for marked nets by exhaustive coverability trees
• Synthesis of Petri net supervisors for FMS via redundant constraint elimination
• Title not available (Why is that?)
• 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)