A note on fault diagnosis algorithms

Franck Cassez*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

7 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 48th IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages6941-6946
Number of pages6
ISBN (Print)9781424438716
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC - 2009 - Shanghai, China
Duration: 15 Dec 200918 Dec 2009

Other

Other48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC - 2009
CountryChina
CityShanghai
Period15/12/0918/12/09

Fingerprint Dive into the research topics of 'A note on fault diagnosis algorithms'. Together they form a unique fingerprint.

Cite this