K-Codiagnosability Verification of Labeled Petri Nets

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 .

K-diagnosability analysis of bounded and unbounded Petri nets using linear optimization

“…The early works that addressed DES diagnosability issues mostly considered FSA models [10,23]. Then, diagnosability analysis was extended to the Petri Net (PN) formalism [1,2,5,7,8,14,19,28,29], taking advantage of its mathematical and graphical representations. On the one hand, the idea behind the works that investigate the graphical representation of PN state set consists in extending the FSA based techniques (i.e., diagnoserbased and verifier-based techniques) by considering the ★ This work is part of the ELSAT2020 program co-funded by the European Union with the European Regional Development Fund, the French state and the Hauts-de-France.…”

“…behavior of the PN captured by its reachability graph (in the case of bounded systems) or coverability graph (in the case of unbounded systems). Such approaches are referred to as graph-based [5,7,8,14,19]. On the other hand, some further works are based on the mathematical representation of PN in order to reformulate the diagnosability problem as a linear optimization problem, which can be then tackled by means of existing optimization techniques, particularly, Integer Linear Programming (ILP).…”

Deadlock Control and Fault Detection and Treatment in Reconfigurable Manufacturing Systems Using Colored Resource-Oriented Petri Nets Based on Neural Network

“…Many policies have been developed in the literature based on Petri nets, focusing on three strategies: prevention of deadlocks, avoidance of deadlocks, and detection and recovery of deadlocks [4,5]. Most of these policies assume that the resources in automated manufacturing systems are reliable [6][7][8][9][10][11][12][13], and others assume that they are unreliable [14][15][16][17][18][19][20][21][22][23][24][25]. Two analysis techniques in PNs are used to design deadlock control policies: reachability graph analysis [26][27][28] and structural analysis [3,6].…”

Strict Minimal Siphon-Based Colored Petri Net Supervisor Synthesis for Automated Manufacturing Systems With Unreliable Resources

“…Various deadlock control methods and fault detection have been developed for different classes of Petri nets under unreliable resources [26]- [36]. Lawley and Sulistyono [26] investigated the allocation of resources to a manufacturing system with unreliable resources by designing supervisory control policies that allocate buffer space.…”