DSPN: Deadlock Detection and Solutions of Reachability Graphs for Petri Nets

Abstract

Deadlocks will lead to a lower utilization of resources, and even crashes of a system. And 3% of program defects are caused by deadlocks. The petri net refers to a mathematical representation of discrete parallel systems, and it can effectively represent the net model of resource flow. This paper judges the system liveness via the reachability graphs of Petri nets, determines the minimum cut set that causes deadlock by the fault diagnosis, combines the reachability graphs and the effective location of fault diagnosis to determine the problems which causes no liveness in Petri nets, solves the deadlock issue through the improvement of the directed arc of problems, and verifies the effectiveness of the proposed method by a mutex.4.