The Complexity of Codiagnosability for Discrete Event and Timed Systems
From MaRDI portal
Cited in
(15)- Verification complexity of a class of observational properties for modular discrete events systems
- Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications
- Implementation of inference-based diagnosis: computing delay bound and ambiguity levels
- Diagnosability verification using LTL model checking
- Detectability of labeled weighted automata over monoids
- Decentralized diagnosis of discrete event systems subject to permanent sensor failures
- Decentralized fault diagnosis approach without a global model for fault diagnosis of discrete event systems
- Computation of the delay bounds and synthesis of diagnosers for decentralized diagnosis with conditional decisions
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
- Codiagnosability Analysis of Discrete-Event Systems Modeled by Weighted Automata
- Verification of Codiagnosability for Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output Functions
- On the verification of detectability for timed discrete event systems
- Diagnosability of labeled \(\mathfrak{D}_{\mathfrak{p}}\)-automata
- Reliable decentralized failure diagnosis of discrete event systems using single-level inference
- Codiagnosability and coobservability under dynamic observations: transformation and verification
This page was built for publication: The Complexity of Codiagnosability for Discrete Event and Timed Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5352876)
