Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches
From MaRDI portal
Publication:2058490
Recommendations
Cites work
- A polynomial algorithm for testing diagnosability of discrete-event systems
- 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
- Comments on ``Polynomial time verification of decentralized diagnosability of discrete event systems versus ``Decentralized failure diagnosis of discrete event systems: complexity clarification
- Computation of Diagnosable Fault-Occurrence Indices for Systems With Repeatable Faults
- Computation of minimal diagnosis bases of discrete-event systems using verifiers
- Computation of minimal event bases that ensure diagnosability
- Control problems in a temporal logic framework
- Diagnosability Analysis of Discrete Event Systems with Autonomous Components
- Diagnosability analysis of patterns on bounded labeled prioritized Petri nets
- Diagnosability of discrete event systems and its applications
- Diagnosability of discrete-event systems
- Diagnosability of intermittent sensor faults in discrete event systems
- Diagnosability of repairable faults
- Diagnosability of stochastic discrete-event systems
- Diagnosis of intermittent faults
- Event counting of partially-observed discrete-event systems with uniformly and nonuniformly bounded diagnosis delays
- Failure Diagnosis of Discrete-Event Systems With Linear-Time Temporal Logic Specifications
- Fault diagnosis in discrete-event systems: Framework and model reduction
- Finding All the Elementary Circuits of a Directed Graph
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 744045 (Why is no real title available?)
- Introduction to Discrete Event Systems
- Model-based detection of routing events in discrete flow networks
- On observability of discrete-event systems
- Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
- Robust diagnosis of discrete event systems against intermittent loss of observations
- Scaling Algorithms for the Shortest Paths Problem
- Shortest paths algorithms: Theory and experimental evaluation
- State observer for DES under partial observation with time Petri nets
- “Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems” Versus “Decentralized Failure Diagnosis of Discrete Event Systems”: A Critical Appraisal
Cited in
(8)- K-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
- Diagnosability of intermittent sensor faults in discrete event systems
- Diagnosability Analysis of Discrete Event Systems with Autonomous Components
- Probabilistic verification of diagnosability for a certain class of timed stochastic systems
- A language-based diagnosis framework for permanent and intermittent faults
- Silent closure based pair verifier for fault pattern diagnosis of discrete event systems
- Diagnosis of intermittent faults
- Modular fault diagnosis based on discrete event systems
This page was built for publication: Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2058490)
