NP-completeness of sensor selection problems arising in partially observed discrete-event systems
From MaRDI portal
Cited in
(17)- Model-based detection of routing events in discrete flow networks
- Verification of opacity and diagnosability for pushdown systems
- A diagnoser algorithm for anomaly detection in DEDS under partial and unreliable observations: characterization and inclusion in sensor configuration optimization
- On infinite-horizon sensor scheduling
- Active acquisition of information for diagnosis and supervisory control of discrete event systems
- On Most Permissive Observers in Dynamic Sensor Activation Problems
- Privacy preserving minimal observability for composite transactional services
- Minimal sensor activation and minimal communication in discrete-event systems
- On the computation of natural observers in discrete-event systems
- Computation of minimal event bases that ensure diagnosability
- Minimization of sensor activation in discrete-event systems with control delays and observation delays
- Event counting of partially-observed discrete-event systems with uniformly and nonuniformly bounded diagnosis delays
- Approximating the minimal sensor selection for supervisory control
- Supervisory control of discrete event systems with distinguishers
- Diagnosis of behaviors of interest in partially-observed discrete-event systems
- Detectability of discrete event systems with dynamic event observation
- Optimal sensor activation for diagnosing discrete event systems
This page was built for publication: NP-completeness of sensor selection problems arising in partially observed discrete-event systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267080)