A note on fault diagnosis algorithms

Franck Cassez

doi:10.1109/CDC.2009.5399968

A note on fault diagnosis algorithms

Franck Cassez^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

10 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 language	English
Title of host publication	Proceedings of the 48th IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	6941-6946
Number of pages	6
ISBN (Print)	9781424438716
DOIs	https://doi.org/10.1109/CDC.2009.5399968
Publication status	Published - 2009
Externally published	Yes
Event	48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC - 2009 - Shanghai, China Duration: 15 Dec 2009 → 18 Dec 2009

Other

Other	48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC - 2009
Country/Territory	China
City	Shanghai
Period	15/12/09 → 18/12/09

Access to Document

10.1109/CDC.2009.5399968

Cite this

@inproceedings{d69ebb4baad54dfbb6993f1ff267aa7b,

title = "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{\"u}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.",

author = "Franck Cassez",

year = "2009",

doi = "10.1109/CDC.2009.5399968",

language = "English",

isbn = "9781424438716",

pages = "6941--6946",

booktitle = "Proceedings of the 48th IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC - 2009 ; Conference date: 15-12-2009 Through 18-12-2009",

}

Cassez, F 2009, A note on fault diagnosis algorithms. in Proceedings of the 48th IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference., 5399968, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 6941-6946, 48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC - 2009, Shanghai, China, 15/12/09. https://doi.org/10.1109/CDC.2009.5399968

A note on fault diagnosis algorithms. / Cassez, Franck.
Proceedings of the 48th IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2009. p. 6941-6946 5399968.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - A note on fault diagnosis algorithms

AU - Cassez, Franck

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/77950856327

U2 - 10.1109/CDC.2009.5399968

DO - 10.1109/CDC.2009.5399968

M3 - Conference proceeding contribution

AN - SCOPUS:77950856327

SN - 9781424438716

SP - 6941

EP - 6946

BT - Proceedings of the 48th IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC - 2009

Y2 - 15 December 2009 through 18 December 2009

ER -

A note on fault diagnosis algorithms

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this