A Polynomial Deadlock Avoidance Method for a Class of Nonsequential Resource Allocation Systems Export

@article{EzpeletaValk06, abstract = {This correspondence introduces a deadlock-avoidance algorithm for a class of manufacturing systems with the following characteristics: 1) Production orders are allowed to have assembly operations (which give the nonsequential nature to the resource allocation system model) but not disassembly operations, 2) the use of system resources must be conservative (resources are neither created nor destroyed), and 3) actions related to the granting of resources are controllable. The proposed solution represents a sufficient condition for a given system state to be safe and is based on an adaptation of the well-known Banker's approach for deadlock avoidance. The time complexity of the proposed solution is proved to be polynomial with the size of the Place/Transition net model}, author = {Ezpeleta, J. and Valk, R.}, citeulike-article-id = {1117770}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1715493}, journal = {Systems, Man and Cybernetics, Part A, IEEE Transactions on}, keywords = {banker, deadlock, nets, petri, ras}, number = {6}, pages = {1234--1243}, posted-at = {2007-02-22 12:38:56}, priority = {2}, title = {A Polynomial Deadlock Avoidance Method for a Class of Nonsequential Resource Allocation Systems}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1715493}, volume = {36}, year = {2006} }

TY - JOUR ID - EzpeletaValk06 L3 - citeulike-article-id:1117770 N2 - This correspondence introduces a deadlock-avoidance algorithm for a class of manufacturing systems with the following characteristics: 1) Production orders are allowed to have assembly operations (which give the nonsequential nature to the resource allocation system model) but not disassembly operations, 2) the use of system resources must be conservative (resources are neither created nor destroyed), and 3) actions related to the granting of resources are controllable. The proposed solution represents a sufficient condition for a given system state to be safe and is based on an adaptation of the well-known Banker's approach for deadlock avoidance. The time complexity of the proposed solution is proved to be polynomial with the size of the Place/Transition net model IS - 6 JF - Systems, Man and Cybernetics, Part A, IEEE Transactions on EP - 1243 TI - A Polynomial Deadlock Avoidance Method for a Class of Nonsequential Resource Allocation Systems VL - 36 SP - 1234 KW - banker KW - deadlock KW - nets KW - petri KW - ras AU - Ezpeleta, J AU - Valk, R PY - 2006/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1715493 ER -