K-Diagnosability of Time Labeled Petri Nets

Abstract In this paper we present a procedure to analyze the K -diagnosability of a labeled Time Petri net system. A labeled Time Petri net system is K -diagnosable if any fault occurrence can be detected after at most K observations. The proposed approach uses the Modified State Class Graph, a graph the authors recently introduced for the marking estimation of time Petri nets, and that they extend here to labeled time Petri nets. It is inspired by the Diagnoser Approach by Sampath et al for the diagnosability of discrete automata and requires the solution of some linear programming problems.

[1]  Francesco Basile,et al.  Marking estimation of Time Petri nets with unobservable transitions , 2013, 2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA).

[2]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[3]  Mariagrazia Dotoli,et al.  Fault Detection of Discrete Event Systems Using Petri Nets and Integer Linear Programming , 2008 .

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

[5]  Alessandro Giua,et al.  A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets , 2012, IEEE Transactions on Automatic Control.

[6]  Cristian Mahulea,et al.  Fault Diagnosis Graph of time Petri nets , 2013, 2013 European Control Conference (ECC).

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

[8]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[9]  Gianmaria De Tommasi,et al.  An Efficient Approach for Online Diagnosis of Discrete Event Systems , 2009, IEEE Transactions on Automatic Control.

[10]  George Jiroveanu,et al.  A distributed approach for fault detection and diagnosis based on Time Petri Nets , 2006, Math. Comput. Simul..

[11]  Shahin Hashtrudi-Zad,et al.  Fault diagnosis in discrete-event systems: incorporating timing information , 2005, IEEE Transactions on Automatic Control.

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

[13]  Carla Seatzu,et al.  Control of Discrete-Event Systems , 2012, Lecture Notes in Control and Information Sciences.

[14]  Philip Meir Merlin,et al.  A study of the recoverability of computing systems. , 1974 .

[15]  Patrice Bonhomme.  State observer synthesis of real-time systems modeled by P-time Petri nets , 2013, 2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA).