Article

Fault diagnosis using timed automata

Authors:

Patricia Bouyer,

Fabrice Chevalier,

Deepak D'SouzaAuthors Info & Claims

FOSSACS'05: Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Pages 219 - 233

https://doi.org/10.1007/978-3-540-31982-5_14

Published: 04 April 2005 Publication History

Abstract

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.

References

[1]

R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science (TCS), 126(2):183-235, 1994.

[2]

R. Alur, L. Fix, and T.A. Henzinger. A determinizable class of timed automata. In Proc. 6th Int. Conf. on Computer Aided Verification (CAV'94), vol. 818 of LNCS, pp. 1-13. Springer, 1994.

[3]

B. Bérard, V. Diekert, P. Gastin, and A. Petit. Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae, 36(2-3):145-182, 1998.

[4]

P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed control with partial observability. In Proc. 15th Int. Conf. Computer Aided Verification (CAV'2003), vol. 2725 of LNCS, pp. 180-192. Springer, 2003.

[5]

F. Chevalier. Détection d'erreurs dans les systèmes temporisés. Master's thesis, DEA Algorithmique, Paris, 2004.

[6]

D. D'Souza and P. Madhusudan. Timed control synthesis for external specifications. In Proc. 19th Int. Symp. Theoretical Aspects of Computer Science (STACS'02), vol. 2285 of LNCS, pp. 571-582. Springer, 2002.

[7]

D. D'Souza and N. Tabareau. On timed automata with input-determined guards. In Proc. Joint Conf. Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault Tolerant System (FORMATS+FTRTFT'04), vol. 3253 of LNCS, pp. 68-83. Springer, 2004.

[8]

O. Grinchtein, B. Jonsson, and M. Leucker. Learning of event-recording automata. In Proc. Joint Conf. Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault Tolerant System (FORMATS+FTRTFT'04), vol. 3253 of LNCS, pp. 379-395. Springer, 2004.

[9]

E. Grädel, W. Thomas, and T. Wilke, eds. Automata, Logics, and Infinite Games: A Guide to Current Research, vol. 2500 of LNCS. Springer, 2002.

[10]

K.J. Kristoffersen, C. Pedersen, and H.R. Andersen. Runtime verification of timed LTL using disjunctive normalized equation systems. In Proc. 3rd Int. Work. Runtime Verification, Electronic Notes in Computer Science. Elsevier, 2003.

[11]

M. Krichen and S. Tripakis. Real-time testing with timed automata testers and coverage criteria. In Proc. Joint Conf. Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault Tolerant System (FORMATS+ FTRTFT'04), vol. 3253 of LNCS, pp. 134-151. Springer, 2004.

[12]

F. Laroussinie, K.G. Larsen, and C. Weise. From timed automata to logic - and back. In Proc. 20th Int. Symp. Mathematical Foundations of Computer Science (MFCS'95), vol. 969 of LNCS, pp. 529-539. Springer, 1995.

[13]

C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

[14]

M. Sampath, R. Sengupta, S. Lafortune, K. Sinnamohideen, and D. C. Teneketzis. Diagnosability of discrete event systems. IEEE Transactions on Automatic Control, 40(9):1555-1575, 1995.

[15]

M. Sampath, R. Sengupta, S. Lafortune, K. Sinnamohideen, and D. C. Teneketzis. Failure diagnosis using discrete event systems. IEEE Transactions on Control Systems Technology, 4(2):105-124, 1996.

[16]

S. Tripakis. Fault diagnosis for timed automata. In Proc. 7th Int. Symp. Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT'02), vol. 2469 of LNCS, pp. 205-224. Springer, 2002.

[17]

S. Tripakis. Folk theorems on the determinization and minimization of timed automata. In Proc. 1st Int. Work. on Formal Modeling and Analysis of Timed Systems (FORMATS'03), vol. 2791 of LNCS, pp. 182-188. Springer, 2003.

Cited By

Du HWang YXu XLiu M(2023)Niffler: Real-time Device-level Anomalies Detection in Smart HomeACM Transactions on the Web10.1145/358607317:3(1-27)Online publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1145/3586073
André ÉBolat SLefaucheux EMarinho DArtho CÖlveczky P(2022)strategFTO: Untimed Control for Timed OpacityProceedings of the 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems10.1145/3563822.3568013(27-33)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3563822.3568013
(2018)Diagnosability analysis and fault diagnosis of P-time labelled Petri netsInternational Journal of Critical Computer-Based Systems10.1504/IJCCBS.2018.0918568:1(78-103)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1504/IJCCBS.2018.091856
Show More Cited By

Index Terms

Fault diagnosis using timed automata
1. Theory of computation
  1. Formal languages and automata theory

Index terms have been assigned to the content through auto-classification.

Recommendations

Interrupt Timed Automata: verification and expressiveness

We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.

While the reachability problem is undecidable for ...
Alternating timed automata

A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages that is closed under boolean operations and which has an ...
Fault Diagnosis for Timed Automata
FTRTFT '02: Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2

We study the problem of fault-diagnosis in the context of dense-time automata. The problem is, given the model of a plant as a timed automaton with a set of observable events and a set of unobservable events, including a special event modeling faults, ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

FOSSACS'05: Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

April 2005

520 pages

ISBN:3540253882

Editor:
Vladimiro Sassone
ECS, University of Southampton, UK

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 04 April 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Du HWang YXu XLiu M(2023)Niffler: Real-time Device-level Anomalies Detection in Smart HomeACM Transactions on the Web10.1145/358607317:3(1-27)Online publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1145/3586073
André ÉBolat SLefaucheux EMarinho DArtho CÖlveczky P(2022)strategFTO: Untimed Control for Timed OpacityProceedings of the 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems10.1145/3563822.3568013(27-33)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3563822.3568013
(2018)Diagnosability analysis and fault diagnosis of P-time labelled Petri netsInternational Journal of Critical Computer-Based Systems10.1504/IJCCBS.2018.0918568:1(78-103)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1504/IJCCBS.2018.091856
Lin QAdepu SVerwer SMathur AKim JAhn GKim SKim YLopez JKim T(2018)TABORProceedings of the 2018 on Asia Conference on Computer and Communications Security10.1145/3196494.3196546(525-536)Online publication date: 29-May-2018
https://dl.acm.org/doi/10.1145/3196494.3196546
Chédor SMorvan CPinchinat SMarchand H(2015)Diagnosis and opacity problems for infinite state systems modeled by recursive tile systemsDiscrete Event Dynamic Systems10.1007/s10626-014-0197-325:1-2(271-294)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1007/s10626-014-0197-3
Abujarad FLin YBonakdarpour BKulkarni S(2015)The complexity of automated addition of fault-tolerance without explicit legitimate statesDistributed Computing10.1007/s00446-014-0227-228:3(201-219)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1007/s00446-014-0227-2
Giavitto JEcheveste JChitil OKing ADanvy O(2014)Real-Time Matching of Antescofo Temporal PatternsProceedings of the 16th International Symposium on Principles and Practice of Declarative Programming10.1145/2643135.2643158(93-104)Online publication date: 8-Sep-2014
https://dl.acm.org/doi/10.1145/2643135.2643158
Cassez FGrastien A(2013)Predictability of event occurrences in timed systemsProceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems10.1007/978-3-642-40229-6_5(62-76)Online publication date: 29-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40229-6_5
Bertrand NStainer AJéron TKrichen M(2011)A game approach to determinize timed automataProceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software10.5555/1987171.1987192(245-259)Online publication date: 26-Mar-2011
https://dl.acm.org/doi/10.5555/1987171.1987192
Bauer ALeucker MSchallhart C(2011)Runtime Verification for LTL and TLTLACM Transactions on Software Engineering and Methodology10.1145/2000799.200080020:4(1-64)Online publication date: 1-Sep-2011
https://dl.acm.org/doi/10.1145/2000799.2000800
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents