Abstract
Fault detection is quite important for discrete event systems. We investigate K-codiagnosability of Petri nets in this paper under the framework that some local sites monitor the operation of the system using their own masks. They exchange information with a coordinator while do not communicate with each other. A fault is detected when there exists a site can diagnose it. We recall the notion of Modified Verifier Nets (MVNs), and prove that K-codiagnosability can be verified looking at some special cycles in the reachability or coverability graph of the MVN. In particular, the proposed approach is available for bounded and unbounded nets. Finally, we give an algorithm to compute the minimum value of K.
Highlights
Any abnormal behavior can be viewed as a fault, and is unavoidable in discrete event systems (DESs)
MAIN RESULT This section will show that K -codiagnosability of an labeled Petri net (PN) systems (LPNSs) can be analyzed using a structure, called Modified Verifier Net (MVN), which is defined as the synchronization of the LPNS with its nonfailure subnets w.r.t. all local sites, where the composition is performed on the alphabet A
The LPNS is codiagnosable iff starting from any faulty node, the R/Coverability Graphs (CGs) of G contains no cycles corresponding to repetitive sequences
Summary
Any abnormal behavior can be viewed as a fault, and is unavoidable in discrete event systems (DESs). The existence of FASs can be computed using the reachability graph of the MVN This approach may be unfeasible in real situations since its complexity may grow exponentially in the worst case. In order to deal with this limitation, some authors of this paper [15] analyze codiagnosability of bounded PNs taking advantage of Basis Markings, which allows ones to look for FASs without enumerating the entire state space. This approach can be used to analyze K -codiagnosability of bounded PNs. In [16], Basile et al analyze K -codiagnosability dealing with integer linear programming (ILP) problems. A method to compute the minimum value of K is given
Sign-in/Register to view highlights & summary 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.
