A Note on Fault Diagnosis Algorithms
Logic in Computer Science
2016-11-17 v1 Formal Languages and Automata Theory
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\"uchi 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.
Cite
@article{arxiv.1004.2764,
title = {A Note on Fault Diagnosis Algorithms},
author = {Franck Cassez},
journal= {arXiv preprint arXiv:1004.2764},
year = {2016}
}
Comments
Note: This paper is an extended version of the paper published in the proceedings of CDC'09, 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference, Shanghai, P.R. China, December 2009.