{"id":"https://openalex.org/W2091571939","doi":"https://doi.org/10.1109/tase.2014.2369858","title":"A BDD-Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems","display_name":"A BDD-Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems","publication_year":2014,"publication_date":"2014-12-19","ids":{"openalex":"https://openalex.org/W2091571939","doi":"https://doi.org/10.1109/tase.2014.2369858","mag":"2091571939"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2014.2369858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2014.2369858","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Automation Science and Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://publications.lib.chalmers.se/records/fulltext/186774/local_186774.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088640436","display_name":"Zhennan Fei","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Zhennan Fei","raw_affiliation_strings":["Automation Research Group, Chalmers University of Technology, Gothenburg, Sweden","[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automation Research Group, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]","institution_ids":["https://openalex.org/I66862912"]}]},{"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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112366882","display_name":"Sajed Miremadi","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sajed Miremadi","raw_affiliation_strings":["Automation Research Group, Chalmers University of Technology, Gothenburg, Sweden","[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automation Research Group, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108805135","display_name":"Knut \u00c5kesson","orcid":"https://orcid.org/0000-0001-6105-2726"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Knut Akesson","raw_affiliation_strings":["Automation Research Group, Chalmers University of Technology, Gothenburg, Sweden","[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automation Research Group, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2163,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92192543,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"3","first_page":"990","last_page":"1006"},"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.9994999766349792,"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.9994999766349792,"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.9987000226974487,"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.9916999936103821,"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/computer-science","display_name":"Computer science","score":0.6961052417755127},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.6194242835044861},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.6120891571044922},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6075005531311035},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5662378072738647},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4524986147880554},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.42480528354644775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11674225330352783},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0930626392364502},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0920805037021637}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6961052417755127},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.6194242835044861},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6120891571044922},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6075005531311035},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5662378072738647},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4524986147880554},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.42480528354644775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11674225330352783},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0930626392364502},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0920805037021637},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tase.2014.2369858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2014.2369858","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Automation Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:publications.lib.chalmers.se:186774","is_oa":true,"landing_page_url":"http://publications.lib.chalmers.se/publication/186774-a-bdd-based-approach-for-designing-maximally-permissive-deadlock-avoidance-policies-for-complex-reso","pdf_url":"http://publications.lib.chalmers.se/records/fulltext/186774/local_186774.pdf","source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.TechReport"},{"id":"pmh:oai:publications.lib.chalmers.se:212385","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/212385-a-bdd-based-approach-for-designing-maximally-permissive-deadlock-avoidance-policies-for-complex-reso","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:212385","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/212385","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":{"id":"pmh:oai:publications.lib.chalmers.se:186774","is_oa":true,"landing_page_url":"http://publications.lib.chalmers.se/publication/186774-a-bdd-based-approach-for-designing-maximally-permissive-deadlock-avoidance-policies-for-complex-reso","pdf_url":"http://publications.lib.chalmers.se/records/fulltext/186774/local_186774.pdf","source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.TechReport"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2091571939.pdf","grobid_xml":"https://content.openalex.org/works/W2091571939.grobid-xml"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W272987332","https://openalex.org/W345018491","https://openalex.org/W627911362","https://openalex.org/W1030620206","https://openalex.org/W1496620875","https://openalex.org/W1498432697","https://openalex.org/W1560264589","https://openalex.org/W1587663028","https://openalex.org/W1595520837","https://openalex.org/W1963884875","https://openalex.org/W1974412011","https://openalex.org/W1976634747","https://openalex.org/W1979184171","https://openalex.org/W1994143452","https://openalex.org/W1996109622","https://openalex.org/W2005217875","https://openalex.org/W2024623468","https://openalex.org/W2030224590","https://openalex.org/W2059057465","https://openalex.org/W2080403682","https://openalex.org/W2099550549","https://openalex.org/W2099982284","https://openalex.org/W2102527810","https://openalex.org/W2104367108","https://openalex.org/W2108569958","https://openalex.org/W2112295486","https://openalex.org/W2112951648","https://openalex.org/W2115425820","https://openalex.org/W2119361484","https://openalex.org/W2121143180","https://openalex.org/W2126325005","https://openalex.org/W2132355828","https://openalex.org/W2133158797","https://openalex.org/W2140197499","https://openalex.org/W2140872435","https://openalex.org/W2146738006","https://openalex.org/W2148748472","https://openalex.org/W2149086924","https://openalex.org/W2153096776","https://openalex.org/W2156553949","https://openalex.org/W2163119090","https://openalex.org/W2170657991","https://openalex.org/W2340735175","https://openalex.org/W2485057492","https://openalex.org/W2509841691","https://openalex.org/W2913459036","https://openalex.org/W4248699123","https://openalex.org/W4250502972","https://openalex.org/W4253331343","https://openalex.org/W4254309944","https://openalex.org/W4285719527","https://openalex.org/W6633429755","https://openalex.org/W6645076307","https://openalex.org/W6676757754","https://openalex.org/W6679967364","https://openalex.org/W6682016725"],"related_works":["https://openalex.org/W2380314807","https://openalex.org/W3140720071","https://openalex.org/W2379911191","https://openalex.org/W2606050762","https://openalex.org/W2012480683","https://openalex.org/W2149273136","https://openalex.org/W1871782314","https://openalex.org/W2177947168","https://openalex.org/W3163502866","https://openalex.org/W2170271432"],"abstract_inverted_index":{"In":[0],"order":[1],"to":[2,41,74,152,221,258],"develop":[3,75],"a":[4,22,30,76,172,179,203,213,269,317],"computationally":[5],"efficient":[6,281],"implementation":[7],"of":[8,29,32,35,49,109,141,156,160,168,171,175,181,227,237,247,268,271,285,311,321,327],"the":[9,27,36,59,88,94,107,110,130,138,142,148,157,166,169,207,219,224,233,238,263,275,282,309,322,328,337],"maximally":[10,111],"permissive":[11,112],"deadlock":[12,197],"avoidance":[13],"policy":[14],"(DAP)":[15],"for":[16,85,114],"complex":[17,115],"resource":[18,288],"allocation":[19,170,188,230],"systems":[20],"(RAS),":[21],"recent":[23,254],"approach":[24],"focuses":[25],"on":[26,80],"identification":[28,265],"set":[31,174,180,270],"critical":[33,272],"states":[34,92,273],"underlying":[37,95,276,323],"RAS":[38,60,96,116],"state-space,":[39],"referred":[40],"as":[42,196],"minimal":[43],"boundary":[44,90],"unsafe":[45,91],"states.":[46],"The":[47,67,98,191,290],"availability":[48],"this":[50,71,187,294,300],"information":[51],"enables":[52,106],"an":[53,228,244],"expedient":[54],"one-step-lookahead":[55],"scheme":[56],"that":[57,103,145,186,205,242,279,333],"prevents":[58],"from":[61,93,308],"reaching":[62],"outside":[63],"its":[64,200],"safe":[65],"region.":[66],"work":[68],"presented":[69,99,292],"in":[70,147,202,274,293,336],"paper":[72,295],"seeks":[73],"symbolic":[77,104,312],"approach,":[78],"based":[79],"binary":[81],"decision":[82],"diagrams":[83],"(BDDs),":[84],"efficiently":[86],"retrieving":[87],"(minimal)":[89],"state-space.":[97],"results":[100,291],"clearly":[101],"demonstrate":[102],"computation":[105],"deployment":[108],"DAP":[113],"with":[117,123,305],"very":[118,234],"large":[119,235],"structure":[120,144],"and":[121,126,199,231,266,298,326,331],"state-spaces":[122],"limited":[124],"time":[125],"memory":[127],"requirements.":[128],"Furthermore,":[129],"involved":[131,335],"computational":[132],"costs":[133],"are":[134,334],"substantially":[135],"reduced":[136],"through":[137,250,262],"pertinent":[139],"exploitation":[140],"special":[143],"exists":[146],"considered":[149],"problem.":[150],"Note":[151],"Practitioners-A":[153],"key":[154],"component":[155],"real-time":[158],"control":[159],"many":[161],"flexibly":[162],"automated":[163],"operations":[164,332],"is":[165,194],"management":[167],"finite":[173],"reusable":[176],"resources":[177],"among":[178],"concurrently":[182],"executing":[183],"processes":[184],"so":[185],"remains":[189],"deadlock-free.":[190],"corresponding":[192],"problem":[193,215],"known":[195],"avoidance,":[198],"resolution":[201],"way":[204],"retains":[206],"sought":[208,257],"operational":[209],"flexibilities":[210],"has":[211,256],"been":[212],"challenging":[214],"due":[216],"to:":[217],"(i)":[218],"inability":[220],"easily":[222],"foresee":[223],"longer-term":[225],"implications":[226,249],"imminent":[229],"(ii)":[232],"sizes":[236],"relevant":[239],"state":[240,277,324],"spaces":[241,325],"prevent":[243],"online":[245],"assessment":[246,284],"these":[248,260,314],"exhaustive":[251],"enumeration.":[252],"A":[253],"methodology":[255,301],"address":[259],"complications":[261],"offline":[264],"storage":[267],"space":[278],"renders":[280],"safety":[283],"any":[286],"given":[287],"allocation.":[289],"further":[296],"extend":[297],"strengthen":[299],"by":[302],"complementing":[303],"it":[304],"techniques":[306,315],"borrowed":[307],"area":[310],"computation;":[313],"enable":[316],"more":[318],"compressed":[319],"representation":[320],"various":[329],"subsets":[330],"pursued":[338],"computation.":[339]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}