A polynomial-complexity deadlock avoidance policy for sequential resource allocation systems with multiple resource acquisitions and flexible routings

Proceedings of the IEEE Conference on Decision and Control

Volumn 3, Issue , 2000, Pages 2663-2669

  Park, J ^a   Reveliotis, S A ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEM RECOVERY; DISCRETE TIME CONTROL SYSTEMS; POLYNOMIALS; RESOURCE ALLOCATION;

DEADLOCK AVOIDANCE POLICY; SEQUENTIAL RESOURCE ALLOCATION SYSTEMS;

SCADA SYSTEMS;

EID: 0034438460     PISSN: 01912216     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Complexity of the deadlock avoidance problem
2. Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows
3. Supervisory control of discrete event systems based on structure theory of Petri nets
4. Deadlock analysis of Petri nets using siphons and mathematical programming
5. A Petri net based deadlock prevention policy for flexible manufacturing systems
6. Event-based feedback control for deadlock avoidance in flexible production systems
7. Deadlock avoidance for sequential resource allocation systems: Hard and easy cases
8. A correct and scalable deadlock avoidance policy for flexible manufacturing systems
9. Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems
10. Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
11. Deadlock avoidance policies for automated manufacturing cells
12. Polynomial complexity deadlock avoidance policies for sequential resource allocation systems
13. A structural approach to the problem of deadlock prevention in processes with resources