Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Synthesis problems (93B50) Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- Active Diagnosis for Probabilistic Systems
- Active diagnosis of discrete-event systems
- Alternating finite automata on -words
- Diagnosability of discrete-event systems
- Diagnosability of stochastic discrete-event systems
- Fault diagnosis in discrete-event systems: incorporating timing information
- Fault diagnosis with static and dynamic observers
- Introduction to Discrete Event Systems
- Memoryless Determinacy of Parity Games
- On the power of imperfect information
- Optimal constructions for active diagnosis
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
Cited in
(10)- Accurate approximate diagnosis of (controllable) stochastic systems
- Diagnosis and degradation control for probabilistic systems
- Active diagnosis of discrete-event systems
- Optimal constructions for active diagnosis
- An Efficient Algorithm for Optimal Design of Diagnostics
- Diagnosability of repairable faults
- Optimal Diagnosable System Design Using Full-Difference Triangles
- \(N\)-diagnosability for active on-line diagnosis in discrete event systems
- Fault diagnosis with static and dynamic observers
- Analysis and control of timed event graphs in (max,+) algebra for the active localization of time failures
This page was built for publication: Optimal constructions for active diagnosis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314815)