K-diagnosability of Time labeled Petri nets

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.