Algebraic deadlock avoidance policies for conjunctive / disjunctive resource allocation systems

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 2001, Pages 70-76

  Park, J ^a   Reveliotis, S A ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; LINEAR PROGRAMMING; PETRI NETS;

ALGEBRAIC DEADLOCK;

RESOURCE ALLOCATION;

EID: 0034867479     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows
2. Supervisory control of discrete event systems based on structure theory of petri nets
3. Deadlock analysis of petri nets using siphons and mathematical programming
4. A petri net based deadlock prevention policy for flexible manufacturing systems
5. Event-based feedback control for dead-lock avoidance in flexible production systems
6. Deadlock avoidance for sequential resource allocation systems: Hard and easy cases
7. A correct and scalable deadlock avoidance policy for flexible manufacturing systems
8. Petri nets: Properties, analysis and applications
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. Liveness-enforcing supervisors for resource allocation systems with reworks, forbidden states, and uncontrollable events
12. A polynomial-complexity deadlock avoidance policy for sequential resource allocation systems with multiple resource acquisitions and flexible routings
13. Dead-lock avoidance policies for automated manufacturing cells
14. Polynomial complexity deadlock avoidance policies for sequential resource allocation systems
15. An iterative method for deadlock prevention in fms