Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications
From MaRDI portal
Publication:1737742
DOI10.1016/j.automatica.2018.12.013zbMath1415.93067OpenAlexW2909384938MaRDI QIDQ1737742
Gustavo S. Viana, João Carlos Basilio
Publication date: 24 April 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2018.12.013
Related Items
Robust decentralized diagnosability of networked discrete event systems against DoS and deception attacks, Decentralized diagnosis of discrete event systems subject to permanent sensor failures, Disjunctive fault prediction of decentralized discrete event systems: verification, predictor design and K-copredictability, A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems, Performance safety enforcement in strongly connected timed event graphs, Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches, \(K\)-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
Uses Software
Cites Work
- Unnamed Item
- Computation of minimal event bases that ensure diagnosability
- Codiagnosability and coobservability under dynamic observations: transformation and verification
- A theory of timed automata
- A necessary and sufficient condition for diagnosability of stochastic discrete event systems
- Empirical studies in the size of diagnosers and verifiers for diagnosability analysis
- Robust diagnosis of discrete event systems against intermittent loss of observations
- Coordinated decentralized protocols for failure diagnosis of discrete event systems
- “Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems” Versus “Decentralized Failure Diagnosis of Discrete Event Systems”: A Critical Appraisal
- Introduction to Discrete Event Systems
- A polynomial algorithm for testing diagnosability of discrete-event systems
- 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
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
- Diagnosability of discrete-event systems
- Finding All the Elementary Circuits of a Directed Graph
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
- Diagnosability Analysis of Labeled Time Petri Net Systems
- Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
- A Generalized Framework for Inference-Based Diagnosis of Discrete Event Systems Capturing Both Disjunctive and Conjunctive Decision-Making
- The Synthesis of Time Optimal Supervisors by Using Heaps-of-Pieces
- The Complexity of Codiagnosability for Discrete Event and Timed Systems
- Fault Diagnosis for Timed Automata
- Depth-First Search and Linear Graph Algorithms
