A polynomial algorithm for testing diagnosability of discrete-event systems

Failure diagnosis in large and complex systems is a critical task. In the realm of discrete-event systems, Sampath et al. (1995) proposed a language based failure diagnosis approach. They introduced the diagnosability for discrete-event systems and gave a method for testing the diagnosability by first constructing a diagnoser for the system. The complexity of this method of testing diagnosability is exponential in the number of states of the system and doubly exponential in the number of failure types. We give an algorithm for testing diagnosability that does not construct a diagnoser for the system, and its complexity is of fourth order in the number of states of the system and linear in the number of the failure types.

[1]  Gregory Provan,et al.  Modeling and diagnosis of timed discrete event systems-a factory automation example , 1997, Proceedings of the 1997 American Control Conference (Cat. No.97CH36041).

[2]  Sujeet Chand,et al.  Time templates for discrete event fault monitoring in manufacturing systems , 1994, Proceedings of 1994 American Control Conference - ACC '94.

[3]  W.M. Wonham,et al.  Fault diagnosis in timed discrete-event systems , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

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

[5]  Feng Lin,et al.  Diagnosability of discrete event systems and its applications , 1994, Discret. Event Dyn. Syst..

[6]  Charles E. Stroud,et al.  Discrete event system approach for delay fault analysis in digital circuits , 1998, Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207).