Algebraic Deadlock Avoidance Policies for Conjunctive / Disjunctive Resource Allocation Systems

Operntional flexibility of deadlock avoidance policies (DAPs) is an essential requirenent for achieving high resource utilization of the underlying deadlock-prone re- source allocation system. This paper presents computational methods for synti, esizing t, ighly flexible DAPs for the class of conjunctivc // disjunctive resource allocation systems (CD-RAS), which generalizes the re- source allocation model that aas been typically studied in the past, by allowing mnltiple resource acquisitions wad flexible foulings. Specificoily, a linear IJ'cagramming method to compute DAs for (7D-RAS is developed and subsequently a series o.f comvutational tools are pro- vided to enhance the policy permissiveness f flexibility. These methods are based on (i) the pertinent exploitation of the policy parameterizetwn, (i) the observation that the considered class of policies is closed under pol- icy disjunctions, and (iii) the systematic reloa:ation of the policy-imposed const'taints through Petri net struc- tural analysis. The presented results are demonstrated through an example modeling an agile automation sys- tem