{"id":"https://openalex.org/W2109692480","doi":"https://doi.org/10.1109/tac.2010.2095612","title":"Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case","display_name":"Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case","publication_year":2010,"publication_date":"2010-12-09","ids":{"openalex":"https://openalex.org/W2109692480","doi":"https://doi.org/10.1109/tac.2010.2095612","mag":"2109692480"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2010.2095612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2010.2095612","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049151543","display_name":"Ahmed Nazeem","orcid":"https://orcid.org/0000-0002-6769-2836"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ahmed Nazeem","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008675858","display_name":"Spyros Reveliotis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spyros Reveliotis","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100330960","display_name":"Yin Wang","orcid":"https://orcid.org/0000-0001-6810-0962"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin Wang","raw_affiliation_strings":["Hewlett Packard Laboratories, USA","Hewlett\u2013Packard Laboratories, Palo Alto, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Hewlett\u2013Packard Laboratories, Palo Alto, CA, USA#TAB#","institution_ids":["https://openalex.org/I1324840837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027585653","display_name":"St\u00e9phane Lafortune","orcid":"https://orcid.org/0000-0002-7526-6642"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"St\u00e9phane Lafortune","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan, USA","Dept. of Electr. Eng. & Comput. Sci., Univ. of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci., Univ. of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.4867,"has_fulltext":false,"cited_by_count":97,"citation_normalized_percentile":{"value":0.98751992,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"56","issue":"8","first_page":"1818","last_page":"1833"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7026205062866211},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5876438617706299},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5763295888900757},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46671053767204285},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46082720160484314},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.4347352385520935},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.4330509901046753},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42759931087493896},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.4239780306816101},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.4198182225227356},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33200621604919434},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31906378269195557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26795294880867004},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19142553210258484}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7026205062866211},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5876438617706299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5763295888900757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46671053767204285},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46082720160484314},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.4347352385520935},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.4330509901046753},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42759931087493896},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.4239780306816101},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.4198182225227356},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33200621604919434},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31906378269195557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26795294880867004},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19142553210258484},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2010.2095612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2010.2095612","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G154054701","display_name":null,"funder_award_id":"CNS-0930081","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4666606172","display_name":"CPS: Small: Control of Distributed Cyber-Physical Systems under Partial Information and Limited Communication","funder_award_id":"0930081","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5234242566","display_name":null,"funder_award_id":"CMMI-0928231","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G651544783","display_name":"Dynamic Deadlock Avoidance in Concurrent Software via Discrete Control","funder_award_id":"0819882","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G949053049","display_name":"Efficient Learning Algorithms for Problems with Acyclic State Spaces and their Application to Reverse Logistics","funder_award_id":"0619978","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W1483186571","https://openalex.org/W1496620875","https://openalex.org/W1587663028","https://openalex.org/W1595520837","https://openalex.org/W1762430620","https://openalex.org/W1789713128","https://openalex.org/W1964718922","https://openalex.org/W1968143987","https://openalex.org/W1968914503","https://openalex.org/W1976634747","https://openalex.org/W1981571779","https://openalex.org/W1996109622","https://openalex.org/W2002089154","https://openalex.org/W2041329792","https://openalex.org/W2041795078","https://openalex.org/W2059057465","https://openalex.org/W2059881462","https://openalex.org/W2061930476","https://openalex.org/W2067967561","https://openalex.org/W2099550549","https://openalex.org/W2102530902","https://openalex.org/W2104367108","https://openalex.org/W2104508180","https://openalex.org/W2104760299","https://openalex.org/W2110169180","https://openalex.org/W2115540709","https://openalex.org/W2119361484","https://openalex.org/W2127825616","https://openalex.org/W2137890200","https://openalex.org/W2139435690","https://openalex.org/W2140872435","https://openalex.org/W2155372793","https://openalex.org/W2156472570","https://openalex.org/W2280816982","https://openalex.org/W2294580796","https://openalex.org/W2336259629","https://openalex.org/W2378962438","https://openalex.org/W2505968561","https://openalex.org/W2509841691","https://openalex.org/W2611804663","https://openalex.org/W4246219036","https://openalex.org/W4300550233","https://openalex.org/W6645528602","https://openalex.org/W6679281492"],"related_works":["https://openalex.org/W2050076411","https://openalex.org/W2001478969","https://openalex.org/W1542183432","https://openalex.org/W2360686363","https://openalex.org/W1900787600","https://openalex.org/W2136552483","https://openalex.org/W2166954426","https://openalex.org/W2117224408","https://openalex.org/W3137070212","https://openalex.org/W2379911191"],"abstract_inverted_index":{"Most":[0],"of":[1,8,24,73,84,101,111,126,146,153,159,165,171,173,190,194,197,231,240,247,253,262,271,283],"the":[2,6,19,22,25,60,63,70,74,108,112,127,154,174,187,191,195,198,209,222,229,232,238,241,251,260,263,272,281,290],"past":[3],"research":[4],"on":[5],"problem":[7,277],"deadlock":[9,28],"avoidance":[10,29],"for":[11,35,51,69,208,228,276],"complex":[12],"resource":[13],"allocation":[14],"systems":[15],"(RAS)":[16],"has":[17,42],"acknowledged":[18],"fact":[20],"that":[21,46,66,87,96,100,105,139,225],"computation":[23,65],"maximally":[26,75,273],"permissive":[27,76,274],"policy":[30,86],"(DAP)":[31],"possesses":[32],"super-polynomial":[33],"complexity":[34,189],"most":[36],"RAS":[37,137],"classes,":[38],"and":[39,62,78,118,150,156,205],"therefore,":[40],"it":[41],"resorted":[43],"to":[44,81,134,182,266],"solutions":[45],"trade":[47],"off":[48],"maximal":[49],"permissiveness":[50],"computational":[52,188,223,248],"tractability.":[53],"In":[54],"this":[55,85,123],"paper,":[56],"we":[57,79,97,130,178,236],"distinguish":[58],"between":[59],"off-line":[61,192],"on-line":[64,91],"is":[67,99,140,226],"required":[68],"effective":[71],"implementation":[72],"DAP,":[77],"seek":[80],"develop":[82],"representations":[83],"will":[88,106],"require":[89],"minimal":[90],"computation.":[92],"The":[93],"particular":[94,136],"representation":[95],"adopt":[98],"a":[102,135,163,169,245],"compact":[103],"classifier":[104],"effect":[107],"underlying":[109],"dichotomy":[110],"reachable":[113],"state":[114],"space":[115],"into":[116],"safe":[117,155],"unsafe":[119,157],"subspaces.":[120],"Furthermore,":[121],"in":[122,186,289],"first":[124],"study":[125],"aforementioned":[128],"problem,":[129,177],"restrict":[131],"our":[132,254],"attention":[133],"class":[138],"motivated":[141],"by":[142],"an":[143],"ongoing":[144],"project":[145],"ours":[147],"called":[148],"Gadara,":[149],"accepts":[151],"separation":[152],"subspaces":[158],"its":[160],"instantiations":[161],"through":[162,244],"set":[164],"linear":[166],"inequalities.":[167],"Through":[168],"series":[170,246],"reductions":[172,185],"derived":[175],"classification":[176],"are":[179],"also":[180,214,258],"able":[181],"attain":[183],"extensive":[184],"task":[193],"construction":[196,230],"sought":[199,233],"classifier.":[200,234],"We":[201,213],"formally":[202],"establish":[203,259],"completeness":[204],"optimality":[206],"properties":[207],"proposed":[210,264],"design":[211],"procedures.":[212],"offer":[215],"heuristics":[216],"that,":[217],"if":[218],"necessary,":[219],"can":[220],"alleviate":[221],"effort":[224],"necessary":[227],"Finally,":[235],"demonstrate":[237],"efficacy":[239],"developed":[242],"approaches":[243],"experiments.":[249],"To":[250],"best":[252],"knowledge,":[255],"these":[256],"experiments":[257],"ability":[261],"methodology":[265],"effectively":[267],"compute":[268],"tractable":[269],"implementations":[270],"DAP":[275],"instances":[278],"significantly":[279],"beyond":[280],"capacity":[282],"any":[284],"other":[285],"approach":[286],"currently":[287],"available":[288],"literature.":[291]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":11}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}