Deadlock avoidance in sequential resource allocations systems with multiple resource acquisitions and flexible routings

IEEE Transactions on Automatic Control

Volumn 46, Issue 10, 2001, Pages 1572-1583

  Park, Jonghun ^a   Reveliotis, Spyros A ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Deadlock avoidance; Liveness; Petri net (PN) structural analysis; Resource allocation systems

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PETRI NETS; RESOURCE ALLOCATION; SET THEORY; THEOREM PROVING;

DEADLOCK AVOIDANCE; LIVENESS; MIXED INTEGER PROGRAMMING; PETRI NET STRUCTURAL ANALYSIS; SEQUENTIAL RESOURCE ALLOCATION SYSTEMS;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0035471203     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.956052     Document Type: Article

References (23)

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. On liveness and controlled siphons in Petri nets
5. Deadlock analysis of Petri nets using siphons and mathematical programming
6. Place/transition Petri nets
7. A Petri net based deadlock prevention policy for flexible manufacturing systems
8. Event-based feedback control for deadlock avoidance in flexible production systems
9. Generalized mutual exclusion constraints on nets with uncontrollable transitions
10. Deadlock avoidance for sequential resource allocation systems: Hard and easy cases
11. A correct and scalable deadlock avoidance policy for flexible manufacturing systems
12. Petri nets: Properties, analysis and applications
13. Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems
14. High-fidelity rapid prototyping of 300 mm fabs through discrete event system modeling
15. Deadlock avoidance policies for automated manufacturing cells
16. Polynomial complexity deadlock avoidance policies for sequential resource allocation systems
17. Linear algebraic and linear programming techniques for the analysis of place/transition net systems
18. A solution to the problem of deadlocks in concurrent systems using Petri nets and integer linear programming
19. A structural approach to the problem of deadlock prevention in processes with resources
20. Deadlock avoidance policy for Petri net modeling of flexible manufacturing systems with shared resources
21. Feedback control of Petri nets based on place invariants