A polynomial deadlock avoidance method for a class of nonsequential resource allocation systems

This correspondence introduces a deadlock-avoidance algorithm for a class of manufacturing systems with the following characteristics: 1) Production orders are allowed to have assembly operations (which give the nonsequential nature to the resource allocation system model) but not disassembly operations, 2) the use of system resources must be conservative (resources are neither created nor destroyed), and 3) actions related to the granting of resources are controllable. The proposed solution represents a sufficient condition for a given system state to be safe and is based on an adaptation of the well-known Banker's approach for deadlock avoidance. The time complexity of the proposed solution is proved to be polynomial with the size of the Place/Transition net model.