Bouyer, Patricia and Chevalier, Fabrice and DSouza, Deepak (2005) Fault Diagnosis Using Timed Automata. In: 8th International Conference, FOSSACS 2005, April 4-8, 2005., Edinburgh, UK..
fulltext.pdf - Published Version
Restricted to Registered users only
Download (209Kb) | Request a copy
Fault diagnosis consists in observing behaviours of systems, and in detecting online whether an error has occurred or not. In the context of discrete event systems this problem has been well-studied, but much less work has been done in the timed framework. In this paper, we consider the problem of diagnosing faults in behaviours of timed plants. We focus on the problem of synthesizing fault diagnosers which are realizable as deterministic timed automata, with the motivation that such diagnosers would function as efficient online fault detectors. We study two classes of such mechanisms, the class of deterministic timed automata (DTA) and the class of event-recording timed automata (ERA). We show that the problem of synthesizing diagnosers in each of these classes is decidable, provided we are given a bound on the resources available to the diagnoser. We prove that under this assumption diagnosability is 2EXPTIME-complete in the case of DTA!s whereas it becomes PSPACE-complete for ERA's.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||20 Jul 2009 12:42|
|Last Modified:||19 Sep 2010 04:55|
Actions (login required)