The Complexity of Codiagnosability for Discrete Event and Timed Systems

In this paper, we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. We then generalize the previous results to the case of dynamic observers. Finally we show that the codiagnosis problem for TA under bounded resources is 2EXPTIME-complete.

[1]  Deepak D'Souza,et al.  Timed Control with Partial Observability , 2003, CAV.

[2]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Kim Guldstrand Larsen,et al.  Formal Methods for the Design of Real-Time Systems , 2004, Lecture Notes in Computer Science.

[4]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[5]  Luca Aceto,et al.  Is your model checker on time? On the complexity of model checking for timed modal logics , 1999, J. Log. Algebraic Methods Program..

[6]  Stéphane Lafortune,et al.  Diagnosis of Discrete Event Systems Using Decentralized Architectures , 2007, Discret. Event Dyn. Syst..

[7]  Patricia Bouyer,et al.  Fault Diagnosis Using Timed Automata , 2005, FoSSaCS.

[8]  Stavros Tripakis,et al.  Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis , 2007, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007).

[9]  Franck Cassez.  A note on fault diagnosis algorithms , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[10]  Gerard J. Holzmann,et al.  Software model checking with SPIN , 2005, Adv. Comput..

[11]  Shengbing Jiang,et al.  A polynomial algorithm for testing diagnosability of discrete-event systems , 2001, IEEE Trans. Autom. Control..

[12]  Franck Cassez.  Dynamic observers for fault diagnosis of timed systems , 2010, 49th IEEE Conference on Decision and Control (CDC).

[13]  Stéphane Lafortune,et al.  Coordinated Decentralized Protocols for Failure Diagnosis of Discrete Event Systems , 2000, Discret. Event Dyn. Syst..

[14]  Stavros Tripakis,et al.  Fault Diagnosis with Static and Dynamic Observers , 2008, Fundam. Informaticae.

[15]  Kim G. Larsen,et al.  A Tutorial on Uppaal , 2004, SFM.

[16]  Stephane Lafortune,et al.  Robust codiagnosability of discrete event systems , 2009, 2009 American Control Conference.

[17]  W. Qiu,et al.  Decentralized failure diagnosis of discrete event systems , 2006, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[18]  Raja Sengupta,et al.  Diagnosability of discrete-event systems , 1995, IEEE Trans. Autom. Control..

[19]  Franck Cassez.  The Complexity of Codiagnosability for Discrete Event and Timed Systems , 2012, IEEE Trans. Autom. Control..

[20]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[21]  Stavros Tripakis,et al.  Fault Diagnosis for Timed Automata , 2002, FTRTFT.

[22]  Jana Kosecka,et al.  Control of Discrete Event Systems , 1992 .

[23]  Olivier Finkel.  On Decision Problems for Timed Automata , 2005, Bull. EATCS.

[24]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[25]  P. Ramadge,et al.  Modular feedback logic for discrete event systems , 1987 .

[26]  Stéphane Lafortune,et al.  Polynomial-time verification of diagnosability of partially observed discrete-event systems , 2002, IEEE Trans. Autom. Control..