Event diagnosis of discrete-event systems with uniformly and nonuniformly bounded diagnosis delays

Various notions of diagnosability reported in literature deal with uniformly bounded finite detection or counting delays. The uniformity of delays can be relaxed while delays remain finite. We introduce various notions of diagnosability allowing nonuniformly bounded finite delays. A polynomial-time verification algorithm for diagnosability with nonuniformly bounded finite indefinite-counting delays is presented. A similar technique is applied to give a computationally better verification algorithm for diagnosability with uniformly bounded finite indefinite-counting delays than algorithms previously reported in literature. Finally, we develop a new on-line diagnosis algorithm that has a lower time and space complexity than on-line diagnosis algorithms reported in literature for counting the occurrence of repeated/intermittent faults.

[1]  Andrew V. Goldberg,et al.  Scaling algorithms for the shortest paths problem , 1995, SODA '93.

[2]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

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

[4]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

[6]  Stéphane Lafortune,et al.  Polynomial-time verification of diagnosability of partially observed discrete-event systems , 2002, IEEE Trans. Autom. Control..

[7]  Shengbing Jiang,et al.  Diagnosis of repeated/intermittent failures in discrete event systems , 2003, IEEE Trans. Robotics Autom..

[8]  H.E. Garcia,et al.  A methodology for detecting routing events in discrete flow networks , 2004, Proceedings of the 2004 American Control Conference.