Skip to Main content Skip to Navigation
Conference papers

A Note on Fault Diagnosis Algorithms

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Franck Cassez Connect in order to contact the contributor
Submitted on : Monday, June 21, 2010 - 5:55:25 AM
Last modification on : Monday, June 21, 2010 - 8:29:04 AM
Long-term archiving on: : Monday, October 22, 2012 - 12:35:42 PM


Files produced by the author(s)


  • HAL Id : inria-00493637, version 1


Franck Cassez. A Note on Fault Diagnosis Algorithms. 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference, Dec 2009, Shanghai, P.R. China, China. ⟨inria-00493637⟩



Record views


Files downloads