On the computational complexity of some problems arising in partially-observed discrete-event systems

Proceedings of the American Control Conference

Volumn 1, Issue , 2001, Pages 307-312

  Yoo, Tae Sic ^a   Lafortune, Stéphane ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OBSERVABILITY; POLYNOMIALS; STATE SPACE METHODS;

CARDINALITY; DIAGNOSABILITY; NORMALITY;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0034840907     PISSN: 07431619     EISSN: None     Source Type: Journal    
DOI: 10.1109/ACC.2001.945562     Document Type: Article

References (11)

1. On an optimization problem in sensor selection
2. Minimizing the cardinality of an events set for for supervisors of discrete-event dynamical systems
3. The computational complexity of decentralized discrete-event control problems
4. Diagnosability of discrete event systems
5. On the control of discrete event dynamical systems
6. A general architecture for decentralized supervisory control of discrete-event systems
7. On the computational complexity of some problems arising in partially-observed discrete-event systems
8. Optimal sensor and actuator choices for discrete event systems