Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems

Abstract

Deadlock avoidance in sequential resource allocation systems is a well-defined problem in discrete event system literature, as it underlies the operation of many contemporary technological systems. In the past, the problem has been studied by means of a number of formal frameworks, including the finite-state automata (FSA) and Petri nets (PNs). In this paper, it is shown that a significant class of deadlock avoidance policies (DAPs), known as algebraic polynomial kernel (PK)-DAPs, originally developed in the FSA paradigm, can be analyzed using recent results from PN structural analysis. Furthermore, the approach to DAP analysis and design taken in this paper has led to the effective generalization of the currently available algebraic PK-DAPs, and to their enrichment with new and more flexible policy implementations.