\(K\)-diagnosability analysis of bounded and unbounded Petri nets using linear optimization

DOI10.1016/j.automatica.2022.110689zbMath1505.93148OpenAlexW4308312308MaRDI QIDQ2103666

Abderraouf Boussif, Mohamed Ghazel, Amira Chouchane

Publication date: 9 December 2022

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2022.110689

zbMATH Keywords

discrete-event systemsPetri netsinteger linear programming\( K / K_{min}\)-diagnosability

Mathematics Subject Classification ID

Integer programming (90C10) Discrete event control/observation systems (93C65) Observability (93B07)

Uses Software

• UMDES

Cites Work

• The covering and boundedness problems for vector addition systems
• Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications
• On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
• Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches
• A lattice-theoretical fixpoint theorem and its applications
• On Most Permissive Observers in Dynamic Sensor Activation Problems
• Robust Disjunctive-Codiagnosability of Discrete-Event Systems Against Permanent Loss of Observations
• On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
• Codiagnosability Analysis of Bounded Petri Nets
• On‐the‐Fly and Incremental Technique for Fault Diagnosis of Discrete Event Systems Modeled by Labeled Petri Nets
• Diagnosability of discrete-event systems
• Codiagnosability Analysis of Discrete-Event Systems Modeled by Weighted Automata
• Estimation and Inference in Discrete Event Systems
• A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets