{"id":"https://openalex.org/W2166860455","doi":"https://doi.org/10.1109/robot.2003.1241730","title":"Structural analysis of resource allocation systems with synchronization constraints","display_name":"Structural analysis of resource allocation systems with synchronization constraints","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W2166860455","doi":"https://doi.org/10.1109/robot.2003.1241730","mag":"2166860455"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2003.1241730","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2003.1241730","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)","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/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":true,"raw_author_name":"S. Reveliotis","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008675858"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"1045","last_page":"1049"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":1.0,"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":1.0,"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.9965000152587891,"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/T11741","display_name":"Flexible and Reconfigurable Manufacturing Systems","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.9089698791503906},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.8452408909797668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7801327705383301},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.711510956287384},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.6552101969718933},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.653354823589325},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6519296169281006},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.6226468682289124},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6213060021400452},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.5743423104286194},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5692751407623291},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5106430649757385},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.45517614483833313},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.44329163432121277},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4233188033103943},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.41459399461746216},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14654541015625},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12183389067649841},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11049079895019531}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.9089698791503906},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8452408909797668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7801327705383301},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.711510956287384},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.6552101969718933},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.653354823589325},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6519296169281006},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6226468682289124},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6213060021400452},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.5743423104286194},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5692751407623291},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5106430649757385},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.45517614483833313},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.44329163432121277},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4233188033103943},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.41459399461746216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14654541015625},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12183389067649841},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11049079895019531},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/robot.2003.1241730","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2003.1241730","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.1289","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.1289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.isye.gatech.edu/~spyros/publications/ICRA_2003_final.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W135243380","https://openalex.org/W634312912","https://openalex.org/W1226693242","https://openalex.org/W1479723887","https://openalex.org/W1551214605","https://openalex.org/W2099550549","https://openalex.org/W2108678912","https://openalex.org/W2140872435","https://openalex.org/W2162140605","https://openalex.org/W6605495437","https://openalex.org/W6628734711","https://openalex.org/W6675983315","https://openalex.org/W6683547611"],"related_works":["https://openalex.org/W4312626387","https://openalex.org/W1651168384","https://openalex.org/W2103504376","https://openalex.org/W2037546465","https://openalex.org/W2153337086","https://openalex.org/W1989082972","https://openalex.org/W1867637656","https://openalex.org/W2329232208","https://openalex.org/W4361186044","https://openalex.org/W1970077768"],"abstract_inverted_index":{"The":[0],"work":[1],"presented":[2],"in":[3,9,24,97,117,131,147,188],"this":[4,199],"paper":[5,32],"extends":[6],"recently":[7],"developed":[8,116,187],"the":[10,25,31,39,47,62,65,69,73,82,92,98,123,138,148,153,163,182,195],"theory":[11],"of":[12,38,51,64,68,84,91,122,133,140,166,181,198],"resource":[13,70,93,150],"allocation":[14,71,94,151],"systems":[15],"(RAS)":[16],"to":[17,61,81,104,159,175],"RAS":[18,41,88],"behaviors":[19,44],"that":[20,79,114,144],"present":[21],"synchronization":[22],"requirements":[23],"underlying":[26,72],"process":[27],"flows.":[28],"More":[29],"specifically,":[30],"first":[33],"provides":[34],"a":[35,105,118],"formal":[36],"definition":[37],"considered":[40,149],"structures":[42],"and":[43,57,136,191],"by":[45],"introducing":[46],"Petri":[48],"net":[49,124],"sub-class":[50],"generalized":[52],"augmented":[53],"marked":[54,112],"graphs":[55],"(G-AMG),":[56],"subsequently,":[58],"it":[59,172],"proceeds":[60],"analysis":[63],"liveness":[66],"properties":[67],"G-AMG":[74,99],"operation.":[75],"It":[76],"is":[77,115,156,173,201],"shown":[78],"similar":[80],"case":[83],"some":[85],"previously":[86],"studied":[87],"structures,":[89],"non-liveness":[90],"taking":[95],"place":[96],"context":[100],"can":[101,145],"be":[102,160],"attributed":[103],"structural":[106],"object":[107],"known":[108],"as":[109],"resource-induced":[110],"deadly":[111],"siphon,":[113],"properly":[119],"defined":[120],"projection":[121],"reachability":[125],"space.":[126],"Beyond":[127],"its":[128],"theoretical":[129],"significance":[130],"terms":[132],"formally":[134],"characterizing":[135],"understanding":[137],"nature":[139],"deadlock":[141],"or":[142],"livelock":[143],"occur":[146],"context,":[152],"aforementioned":[154],"result":[155],"also":[157],"deemed":[158],"important":[161],"from":[162],"practical":[164],"standpoint":[165],"synthesizing":[167],"liveness-enforcing":[168],"supervisors":[169],"(LES),":[170],"since":[171],"expected":[174],"enable":[176],"LES":[177],"synthesis":[178],"through":[179],"application":[180],"correctness":[183],"verification":[184],"methodology":[185],"originally":[186],"(J.":[189],"Park":[190],"S.":[192],"Reveliotis,":[193],"2001);":[194],"actual":[196],"potential":[197],"approach":[200],"currently":[202],"under":[203],"investigation.":[204]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}