{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:30:01Z","timestamp":1775028601842,"version":"3.50.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-0928231"],"award-info":[{"award-number":["CMMI-0928231"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/tac.2013.2266952","type":"journal-article","created":{"date-parts":[[2013,6,7]],"date-time":"2013-06-07T14:01:50Z","timestamp":1370613710000},"page":"2772-2787","source":"Crossref","is-referenced-by-count":33,"title":["Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms"],"prefix":"10.1109","volume":"58","author":[{"given":"Roberto","family":"Cordone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Nazeem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Piroddi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spyros","family":"Reveliotis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/120866427"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CASE.2011.6042400"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2002.807555"},{"key":"ref32","first-page":"364","article-title":"Polynomial algorithms for the synthesis of bounded nets","volume":"915","author":"badouel","year":"1995","journal-title":"Proc CAAP'95"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2012.2226034"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2230814"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.06.068"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TSMCC.2007.913920","article-title":"A survey and comparison of Petri net-based deadlock prevention policies for flexible manufacturing systems","volume":"38","author":"li","year":"2008","journal-title":"IEEE Trans Syst Man Cybern C Appl Rev"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/s001700200014","article-title":"An optimal deadlock prevention policy for flexible manufacturing systems using Petri net models with resources and the theory of regions","volume":"19","author":"uzam","year":"2002","journal-title":"Int J Adv Manuf Technol"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CASE.2011.6042440"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2190139"},{"key":"ref40","author":"reveliotis","year":"0","journal-title":"Formal Methods in Manufacturing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2010.2060332"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2011.01.070"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2179422"},{"key":"ref15","first-page":"229","article-title":"Complexity of the deadlock avoidance problem","author":"araki","year":"1977","journal-title":"2nd IBM Symp Math Foundations Comput Sci"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2046111"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1992.271666"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(95)00103-4"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1080\/07408170008967423","article-title":"Conflict resolution in AGV systems","volume":"32","author":"reveliotis","year":"2000","journal-title":"IIE Trans"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2003.820576"},{"key":"ref3","year":"2004","journal-title":"Deadlock Resolution in Computer-Integrated Systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/00207540010002405"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.929375"},{"key":"ref5","first-page":"64","article-title":"Resource-oriented Petri nets in deadlock avoidance of AGV systems","author":"wu","year":"2001","journal-title":"Proc ICRA'01"},{"key":"ref29","first-page":"271","article-title":"A Petri net structure-based deadlock prevention solution for sequential resource allocation systems","author":"tricas","year":"2005","journal-title":"Proc ICRA'05"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.391"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5399950"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2003.820590"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2095612"},{"key":"ref1","author":"reveliotis","year":"2005","journal-title":"Real-Time Management of Resource Allocation Systems A Discrete Event Systems Approach"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/70.988975"},{"key":"ref46","article-title":"Efficient enumeration of minimal unsafe states in complex resource allocation systems","author":"nazeem","year":"2013","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CoASE.2012.6386337"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2008.2003535"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2007.910701"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68612-7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7"},{"key":"ref41","first-page":"7244","article-title":"Maximally permissive deadlock avoidance for sequential resource allocation systems using disjunctions of linear classifiers","author":"cordone","year":"2013","journal-title":"Proc 51st IEEE Conf Decision Control"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2009.2013189"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187916"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/9.956052"},{"key":"ref43","author":"cook","year":"1998","journal-title":"Combinatorial Optimization"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/70.370500"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/6642086\/06527273.pdf?arnumber=6527273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:36:47Z","timestamp":1638200207000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6527273\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":46,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tac.2013.2266952","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}