Skip to main content


A note on fault diagnosis algorithms


Franck Cassez




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) Buchi 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.

BibTeX Entry

    author           = {Cassez, Franck},
    month            = dec,
    year             = {2009},
    keywords         = {diagnosability, discrete event systems},
    title            = {A Note on Fault Diagnosis Algorithms},
    booktitle        = {48th IEEE Conference on Decision and Control},
    pages            = {6941--6946},
    address          = {Shanghai, China}


Served by Apache on Linux on seL4.