Some improvements to the Banker´s algorithm based on the process structure

The paper presents two methods for deadlock avoidance in concurrent systems. We apply the proposed approaches to flexible manufacturing systems, modeled by means of Petri nets. Both methods correspond to improvements of the classical Banker´s algorithm, and are based on the knowledge of the process structure. The first one is polynomial in the size of the Petri net model. The second one depends strongly on the number of alternative paths for the processing of parts and can be of a non-polynomial cost