A note on fault diagnosis algorithms. Cassez, F. In Ouaknine, J. & Vaandrager, F. W., editors, Proceedings of the 48th IEEE Conference on Decision and Control, CDC 2009, combined withe the 28th Chinese Control Conference, December 16-18, 2009, Shanghai, China, pages 6941–6946, 2009. IEEE.
A note on fault diagnosis algorithms [pdf]Paper  A note on fault diagnosis algorithms [pdf]Slides  doi  abstract   bibtex   
In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) Büchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.

Downloads: 0