{"id":"https://openalex.org/W2094125242","doi":"https://doi.org/10.1109/cdc.2014.7040318","title":"Symbolic computation and representation of deadlock avoidance policies for complex resource allocation systems with application to multithreaded software","display_name":"Symbolic computation and representation of deadlock avoidance policies for complex resource allocation systems with application to multithreaded software","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2094125242","doi":"https://doi.org/10.1109/cdc.2014.7040318","mag":"2094125242"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2014.7040318","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2014.7040318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"53rd IEEE Conference on Decision and Control","raw_type":"proceedings-article"},"type":"conference-paper","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/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","Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, SE-412 96 Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automation Research Group, Chalmers University of Technology, Gothenburg","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, SE-412 96 Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","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","Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, SE-412 96 Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automation Research Group, Chalmers University of Technology, Gothenburg","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, SE-412 96 Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","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, Atlanta, GA, United States","School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, 30332, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, United States","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, 30332, United States","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5935","last_page":"5942"},"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.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.8149796724319458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8018295764923096},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5675384998321533},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.556098461151123},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.531414806842804},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5154064893722534},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.4811305105686188},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.46649953722953796},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34712570905685425},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32008302211761475},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27014148235321045},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1175219714641571}],"concepts":[{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.8149796724319458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8018295764923096},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5675384998321533},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.556098461151123},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.531414806842804},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5154064893722534},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.4811305105686188},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.46649953722953796},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34712570905685425},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32008302211761475},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27014148235321045},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1175219714641571},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cdc.2014.7040318","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2014.7040318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"53rd IEEE Conference on Decision and Control","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.lib.chalmers.se:219557","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/219557-symbolic-computation-and-representation-of-deadlock-avoidance-policies-for-complex-resource-allocati","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.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:219557","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/219557","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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W240454706","https://openalex.org/W627911362","https://openalex.org/W650984362","https://openalex.org/W1496620875","https://openalex.org/W1587663028","https://openalex.org/W1641636991","https://openalex.org/W1996109622","https://openalex.org/W2030224590","https://openalex.org/W2091571939","https://openalex.org/W2112295486","https://openalex.org/W2119361484","https://openalex.org/W2140197499","https://openalex.org/W2153096776","https://openalex.org/W2156472570","https://openalex.org/W2170657991","https://openalex.org/W2485057492","https://openalex.org/W2509841691","https://openalex.org/W4254309944","https://openalex.org/W4289784571","https://openalex.org/W6609302369","https://openalex.org/W6636733807","https://openalex.org/W6673357689"],"related_works":["https://openalex.org/W397120980","https://openalex.org/W1528537929","https://openalex.org/W3021060317","https://openalex.org/W2971368204","https://openalex.org/W2074817166","https://openalex.org/W2140937809","https://openalex.org/W4299824111","https://openalex.org/W2368915530","https://openalex.org/W2755303584","https://openalex.org/W2502647262"],"abstract_inverted_index":{"In":[0,33,82],"our":[1],"recent":[2],"work,":[3],"we":[4,37,60],"proposed":[5],"a":[6,25,43,47,107],"series":[7],"of":[8,27,49,66,85,100,113,128,138,149],"binary":[9],"decision":[10],"diagram":[11],"(BDD-)":[12],"based":[13],"approaches":[14,40],"for":[15,24,143],"developing":[16],"the":[17,55,64,79,83,89,97,101,114,118,123,131,136,139,159],"maximally":[18,140],"permissive":[19,141],"deadlock":[20,67],"avoidance":[21,68],"policy":[22],"(DAP)":[23],"class":[26],"complex":[28],"resource":[29],"allocation":[30],"systems":[31],"(RAS).":[32],"this":[34,86],"paper,":[35],"(i)":[36],"extend":[38],"these":[39],"by":[41,78,121],"introducing":[42],"procedure":[44],"that":[45,73],"generates":[46],"set":[48],"comprehensible":[50],"\u201cguard\u201d":[51],"predicates":[52],"to":[53,63,146],"represent":[54],"resulting":[56],"DAP,":[57],"and":[58,110,125,153],"(ii)":[59],"customize":[61],"them":[62],"problem":[65,147],"in":[69,158],"shared-memory":[70],"multithreaded":[71],"software,":[72],"has":[74],"been":[75],"previously":[76],"addressed":[77,157],"Gadara":[80],"project.":[81],"context":[84],"last":[87],"application,":[88],"generated":[90],"guards":[91],"can":[92,134],"be":[93],"instrumented":[94],"directly":[95],"into":[96],"source":[98],"code":[99],"underlying":[102],"software":[103],"threads,":[104],"providing,":[105],"thus,":[106],"very":[108],"efficient":[109],"natural":[111],"representation":[112],"target":[115],"policy.":[116],"At":[117],"same":[119],"time,":[120],"integrating":[122],"representational":[124],"computational":[126],"strengths":[127],"symbolic":[129],"computation,":[130],"presented":[132],"approach":[133],"support":[135],"computation":[137],"DAP":[142],"RAS":[144],"corresponding":[145],"instances":[148],"even":[150],"larger":[151],"scale":[152],"complexity":[154],"than":[155],"those":[156],"current":[160],"literature.":[161]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}