NP-completeness of sensor selection problems arising in partially observed discrete-event systems

DOI10.1109/TAC.2002.802762zbMath1364.93486OpenAlexW2132443513MaRDI QIDQ5267080

Stéphane Lafortune, Tae-Sic Yoo

Publication date: 20 June 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2002.802762

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (15)

Event counting of partially-observed discrete-event systems with uniformly and nonuniformly bounded diagnosis delays ⋮ 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 ⋮ Approximating the minimal sensor selection for supervisory control ⋮ Supervisory control of discrete event systems with distinguishers ⋮ On infinite-horizon sensor scheduling ⋮ Privacy preserving minimal observability for composite transactional services ⋮ Active acquisition of information for diagnosis and supervisory control of discrete event systems ⋮ Minimal sensor activation and minimal communication in discrete-event systems ⋮ Diagnosis of behaviors of interest in partially-observed discrete-event systems ⋮ Detectability of discrete event systems with dynamic event observation ⋮ Computation of minimal event bases that ensure diagnosability ⋮ Model-based detection of routing events in discrete flow networks ⋮ Optimal sensor activation for diagnosing discrete event systems ⋮ On the computation of natural observers in discrete-event systems

This page was built for publication: NP-completeness of sensor selection problems arising in partially observed discrete-event systems