Accepted for publication in Transactions of Automatic Control Polynomial Time Veri cation of Diagnosability of Partially Observed Discrete Event Systems

The problem of verifying the properties of diagnosability and I diagnosability is considered We present new polynomial time algorithms for deciding diagnosability and I diagnosability These algorithms are based on the construction of a nondeterministic automaton called a veri er

[1]  John N. Tsitsiklis,et al.  On the control of discrete-event dynamical systems , 1987, 26th IEEE Conference on Decision and Control.

[2]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[3]  Raja Sengupta,et al.  Diagnosability of discrete-event systems , 1995, IEEE Trans. Autom. Control..

[4]  Shengbing Jiang,et al.  A polynomial algorithm for testing diagnosability of discrete-event systems , 2001, IEEE Trans. Autom. Control..

[5]  Stéphane Lafortune,et al.  A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems , 2002, Discret. Event Dyn. Syst..

[6]  J. Willems,et al.  The computational complexity of decentralized discrete-event control problems , 1995, IEEE Trans. Autom. Control..