This article presents an efficient integrated approach on designing a non-blocking supervisor for the most general classes of Petri nets, called G -systems that allow Getting Ready multiple resource acquisitions.This work mainly focuses on developing a deadlock prevention policy with a polynomial computational complexity.First, an extraction algorithm of liveness requirement constraints is presented according to the concept of resource partial orders.
By considering the different resource requirements of various processes, monitors are added for the uncontrolled G -system on the basis of those precise linear inequality constraints.Afterward, we explore an iterative control policy by utilizing the traditional mathematical programming method, which can ensure the liveness of the resultant controlled system.Comparing with the existing deadlock control policies reported in the literature, the proposed method can achieve a non-blocking controlled G -system IMMUNOL with simple structure and high computational efficiency.
Finally, a benchmark G -system example is used to substantiate the efficiency of the new method.