Paper Info
Title
Algebraic Deadlock Avoidance Policies For Conjunctive/Disjunctive Resource Allocation Systems
Abstract
Operational flexibility of deadlock avoidance policies (DAPs) is an essential requirement for achieving high resource utilization of the underlying deadlock-prone resource allocation system. This paper presents computational methods for synthesizing highly flexible DAPs for the class of conjunctive / disjunctive resource allocation systems (CD-RAS), which generalizes the resource allocation model that has been typically studied in the past, by allowing multiple resource acquisitions and flexible routings. Specifically, a linear programming method to compute DAPs for CD-RAS is developed, and subsequently a series of computational tools are provided to enhance the policy permissiveness I flexibility. These methods are based on (i) the pertinent exploitation of the policy parameterization, (ii) the observation that the considered class of policies is closed under policy disjunctions, and (iii) the systematic relaxation of the policy-imposed constraints through Petri net structural analysis. The presented results are demonstrated through an example modeling an agile automation system.
Year
DOI
Venue
2001
10.1109/ROBOT.2001.932532
2001 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS
Keywords
Field
DocType
integer programming,resource management,petri nets,polynomials,linear programming,algebra,routing,taxonomy,automation,computer integrated manufacturing,resource allocation
Petri net,Computer science,Deadlock,Computer-integrated manufacturing,Integer programming,Resource allocation,Agile Automation,Linear programming,Deadlock prevention algorithms,Distributed computing
Conference
Volume
Issue
ISSN
1
1
1050-4729
Citations 
PageRank 
References 
2
0.58
10
Authors
2
Name
Order
Citations
PageRank
Jong Hun Park162.55
Spyros A. Reveliotis214018.02