A deadlock detection and prevention method for a class of generalized petri nets under proper resource allocation

Abstract

This paper develops a computationally efficient deadlock control policy for a class of generalized Petri nets, called G-system that can well model machining, assembly and disassembly operations. The primary focus of this research is to design a liveness-enforcing supervisor in polynomially computational complexity. First, an extraction algorithm of liveness requirement constraints with polynomial time complexity is presented with respect to different resource allocation orders. In order to properly allocate the system resources for various processes requirements, monitors are added for the net model in terms of precise liveness requirement constraints. Accordingly, an iterative deadlock control algorithm is established based on mixed integer programming (MIP) such that the resulting net system has no deadlock state. The proposed method can lead to a liveness-enforcing supervisor with high computational efficiency.