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

DOI10.1016/J.AUTOMATICA.2022.110689MaRDI QIDQ2103666zbMATH OpenOpenAlexFDO

Authors Amira Chouchane, Mohamed Ghazel, Abderraouf Boussif

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

integer linear programmingdiscrete-event systemsPetri nets\( K / K_{min}\)-diagnosability

Mathematics Subject Classification ID

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

Recommendations

• On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
• Diagnosability of Petri nets with observation graphs
• Marking diagnosability verification in labeled Petri nets
• Diagnosability analysis of patterns on bounded labeled prioritized Petri nets
• On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets

Cites work

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

Cited in

(6)

• On the cost of diagnosis with disambiguation
• Optimal sensor selection for ensuring diagnosability in labeled Petri nets
• On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets
• Basis coverability graph for partially observable Petri nets with application to diagnosability analysis
• Fault-prognosability, \(K\)-step prognosis and \(K\)-step predictive diagnosis in partially observed Petri nets by means of algebraic techniques
• On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming

Describes a project that uses

Uses Software

• UMDES

This page was built for publication: \(K\)-diagnosability analysis of bounded and unbounded Petri nets using linear optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103666)