Active Diagnosis for Probabilistic Systems

The diagnosis problem amounts to deciding whether some specific “fault” event occurred or not in a system, given the observations collected on a run of this system. This system is then diagnosable if the fault can always be detected, and the active diagnosis problem consists in controlling the system in order to ensure its diagnosability. We consider here a stochastic framework for this problem: once a control is selected, the system becomes a stochastic process. In this setting, the active diagnosis problem consists in deciding whether there exists some observation-based strategy that makes the system diagnosable with probability one. We prove that this problem is EXPTIME-complete, and that the active diagnosis strategies are belief-based. The safe active diagnosis problem is similar, but aims at enforcing diagnosability while preserving a positive probability to non faulty runs, i.e. without enforcing the occurrence of a fault. We prove that this problem requires non belief-based strategies, and that it is undecidable. However, it belongs to NEXPTIME when restricted to belief-based strategies. Our work also refines the decidability/undecidability frontier for verification problems on partially observed Markov decision processes.

[1]  Demosthenis Teneketzis,et al.  Diagnosability of stochastic discrete-event systems , 2005, IEEE Transactions on Automatic Control.

[2]  Yannick Pencolé,et al.  Monitoring and Active Diagnosis for Discrete-Event Systems , 2009 .

[3]  Demosthenis Teneketzis,et al.  Active Acquisition of Information for Diagnosis and Supervisory Control of Discrete Event Systems , 2007, Discrete event dynamic systems.

[4]  Christel Baier,et al.  On Decision Problems for Probabilistic Büchi Automata , 2008, FoSSaCS.

[5]  Petr Hliněný,et al.  Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings , 2010, MFCS.

[6]  Christel Baier,et al.  Probabilistic ω-automata , 2012, JACM.

[7]  Azaria Paz,et al.  Probabilistic automata , 2003 .

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

[9]  Loïg Jezequel,et al.  On the construction of probabilistic diagnosers , 2010, WODES.

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

[11]  Alessandro Giua,et al.  Diagnosability analysis of unbounded Petri nets , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[12]  Moshe Y. Vardi Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Sophie Pinchinat,et al.  Diagnosability of Pushdown Systems , 2009, Haifa Verification Conference.

[14]  Krishnendu Chatterjee,et al.  Randomness for Free , 2010, MFCS.

[15]  Dietmar Berwanger,et al.  On the Power of Imperfect Information , 2008, FSTTCS.

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

[17]  Demosthenis Teneketzis,et al.  Active diagnosis of discrete-event systems , 1998 .

[18]  Nathalie Bertrand,et al.  Qualitative Determinacy and Decidability of Stochastic Games with Signals , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.