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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
