A Note on Fault Diagnosis Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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.
Fichier principal
Vignette du fichier
cdc-09.pdf (121.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00493637 , version 1 (21-06-2010)

Identifiers

  • HAL Id : inria-00493637 , version 1

Cite

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⟩
28 View
83 Download

Share

Gmail Facebook X LinkedIn More