Codiagnosability Analysis of Discrete-Event Systems Modeled by Weighted Automata
From MaRDI portal
Recommendations
- Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications
- The Complexity of Codiagnosability for Discrete Event and Timed Systems
- The complexity of codiagnosability for discrete event and timed systems
- Diagnosability Analysis of Discrete Event Systems with Autonomous Components
- Verification of Codiagnosability for Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output Functions
- Minimal diagnosis and diagnosability of discrete-event systems modeled by automata
- Diagnosability of discrete-event systems
- Diagnosability of a class of discrete event systems based on observations
- Codiagnosability of Networked Discrete Event Systems With Timing Structure
- Abstraction-based verification of codiagnosability for discrete event systems
Cited in
(7)- Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches
- Enforcing current-state opacity through shuffle and deletions of event observations
- K-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
- Robust decentralized diagnosability of networked discrete event systems against DoS and deception attacks
- Minimal diagnosis and diagnosability of discrete-event systems modeled by automata
- Disjunctive fault prediction of decentralized discrete event systems: verification, predictor design and K-copredictability
- Verification of Codiagnosability for Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output Functions
This page was built for publication: Codiagnosability Analysis of Discrete-Event Systems Modeled by Weighted Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211195)