DocumentCode :
1468177
Title :
Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems"
Author :
Park, Jonghun ; Reveliotis, Spyros A. ; Lawley, Mark A. ; Ferreira, Placid M.
Author_Institution :
Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Volume :
46
Issue :
4
fYear :
2001
fDate :
4/1/2001 12:00:00 AM
Firstpage :
672
Abstract :
This note first identifies a problem with the correctness of the RUN DAP for conjunctive RAS, presented in the above paper by Reveliotis et al. (1997), and subsequently proceeds to the problem correction through an appropriate policy modification.
Keywords :
Petri nets; computational complexity; resource allocation; Petri nets; RUN DAP; conjunctive RAS; deadlock avoidance policy; polynomial-complexity; resource allocation; Capacity planning; Control systems; Counting circuits; Digital audio players; Equations; Industrial engineering; Polynomials; Resource management; System recovery; Systems engineering and theory;
fLanguage :
English
Journal_Title :
Automatic Control, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9286
Type :
jour
DOI :
10.1109/9.917717
Filename :
917717
Link To Document :
بازگشت