Polynomial-time verification of diagnosability of partially observed discrete-event systems

IEEE Transactions on Automatic Control

Volumn 47, Issue 9, 2002, Pages 1491-1495

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

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Computational complexity; Diagnosability verification; Discrete event systems; Failure diagnosis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTROL SYSTEM ANALYSIS; MATHEMATICAL MODELS; OBSERVABILITY; POLYNOMIALS;

DIAGNOSABILITY; FAILURE DIAGNOSIS;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0036741824     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2002.802763     Document Type: Article

References (7)

1. M. Sampath, R. Sengupta, K. Sinnamohideen, S. Lafortune, and D. Teneketzis, "Diagnosability of discrete event systems," IEEE Trans. Automat. Contr., vol. 40, pp. 1555-1575, Sept. 1995.
2. S. Jiang, Z. Huang, V. Chandra, and R. Kumar, "A polynomial-time algorithm for diagnosability of discrete event systems," IEEE Trans. Automat. Contr., vol. 46, pp. 1318-1321, Aug. 2001.
3. J. N. Tsitsiklis, "On the control of discrete event dynamical systems," Mat. Control Sig. Syst., vol. 2, no. 2, pp. 95-107, 1989.
4. K. Rudie and J. C. Willems, "The computational complexity of decentralized discrete-event control problems," IEEE Trans. Automat. Contr., vol. 40, pp. 1313-1318, July 1995.
5. T. Yoo and S. Lafortune, "A general architecture for decentralized supervisory control of discrete-event systems," Discrete Event Dyn. Syst.: Theory Appl., vol. 12, no. 3, pp. 335-377, July 2002.
6. C. G. Cassandras and S. Lafortune, Introduction to Discrete Event Systems. Norwell, MA: Kluwer, 1999.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.