{"id":"https://openalex.org/W4403180447","doi":"https://doi.org/10.46298/lmcs-20(4:6)2024","title":"Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks","display_name":"Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks","publication_year":2024,"publication_date":"2024-10-07","ids":{"openalex":"https://openalex.org/W4403180447","doi":"https://doi.org/10.46298/lmcs-20(4:6)2024"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-20(4:6)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(4:6)2024","pdf_url":"https://lmcs.episciences.org/14412/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/14412/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052455553","display_name":"Bas van den Heuvel","orcid":"https://orcid.org/0000-0002-8264-7371"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bas van den Heuvel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5034548013","display_name":"Jorge A. P\u00e9rez","orcid":"https://orcid.org/0000-0002-1452-6180"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jorge A. P\u00e9rez","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052455553"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.343,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.615625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"Volume 20, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9947999715805054,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8477264642715454},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.8138411045074463},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.7355843186378479},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.692138671875},{"id":"https://openalex.org/keywords/session","display_name":"Session (web analytics)","score":0.6538587808609009},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.512162446975708},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.44288474321365356},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3920729160308838},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3674136996269226},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25670933723449707}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8477264642715454},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8138411045074463},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.7355843186378479},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.692138671875},{"id":"https://openalex.org/C2779182362","wikidata":"https://www.wikidata.org/wiki/Q17126187","display_name":"Session (web analytics)","level":2,"score":0.6538587808609009},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.512162446975708},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44288474321365356},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3920729160308838},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3674136996269226},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25670933723449707},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.46298/lmcs-20(4:6)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(4:6)2024","pdf_url":"https://lmcs.episciences.org/14412/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:publications/fa79af55-0a97-4586-a5d4-11ec8f471bfe","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/fa79af55-0a97-4586-a5d4-11ec8f471bfe","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van den Heuvel, B & P\u00e9rez, J A 2024, 'Asynchronous Session-Based Concurrency : Deadlock-freedom in Cyclic Process Networks', Logical Methods in Computer Science, vol. 20, no. 4, pp. 6:1-6:103. https://doi.org/10.46298/lmcs-20(4:6)2024","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:2cc4fe93d27a470a9fe8c4ac247ac316","is_oa":true,"landing_page_url":"https://doaj.org/article/2cc4fe93d27a470a9fe8c4ac247ac316","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 20, Issue 4 (2024)","raw_type":"article"},{"id":"pmh:oai:freidok.uni-freiburg.de:264684","is_oa":false,"landing_page_url":"https://freidok.uni-freiburg.de/data/264684","pdf_url":null,"source":{"id":"https://openalex.org/S4306401057","display_name":"FreiDok plus (Universit\u00e4tsbibliothek Freiburg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I161046081","host_organization_name":"University of Freiburg","host_organization_lineage":["https://openalex.org/I161046081"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical methods in computer science. - Volume 20, Issue 4 (2024) , 6:1-6:102, ISSN: 1860-5974","raw_type":"article"},{"id":"pmh:oai:pure.rug.nl:openaire/fa79af55-0a97-4586-a5d4-11ec8f471bfe","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/fa79af55-0a97-4586-a5d4-11ec8f471bfe","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"van den Heuvel, B & P\u00e9rez, J A 2024, 'Asynchronous Session-Based Concurrency : Deadlock-freedom in Cyclic Process Networks', Logical Methods in Computer Science, vol. 20, no. 4, pp. 6:1-6:103. https://doi.org/10.46298/lmcs-20(4:6)2024","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.46298/lmcs-20(4:6)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(4:6)2024","pdf_url":"https://lmcs.episciences.org/14412/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.8199999928474426,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4403180447.pdf","grobid_xml":"https://content.openalex.org/works/W4403180447.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4230197055","https://openalex.org/W4296749040","https://openalex.org/W621808327","https://openalex.org/W644007644","https://openalex.org/W2497198634","https://openalex.org/W2365256108","https://openalex.org/W2153246750","https://openalex.org/W2355319912","https://openalex.org/W2391570358","https://openalex.org/W2003908543"],"abstract_inverted_index":{"We":[0,81],"tackle":[1],"the":[2,6,48,99],"challenge":[3],"of":[4,111,124],"ensuring":[5],"deadlock-freedom":[7,100],"property":[8],"for":[9,62],"message-passing":[10],"processes":[11,116],"that":[12,35,119],"communicate":[13],"asynchronously":[14],"in":[15,42,91,113,117],"cyclic":[16,43],"process":[17,33,44],"networks.":[18,45],"Our":[19],"contributions":[20],"are":[21],"twofold.":[22],"First,":[23],"we":[24,57,69,93,107],"present":[25,70],"Asynchronous":[26],"Priority-based":[27],"Classical":[28],"Processes":[29],"(APCP),":[30],"a":[31,71,109,121],"session-typed":[32],"framework":[34],"supports":[36],"asynchronous":[37,76],"communication,":[38],"delegation,":[39],"and":[40,54,86],"recursion":[41],"Building":[46],"upon":[47],"Curry-Howard":[49],"correspondences":[50],"between":[51],"linear":[52],"logic":[53],"session":[55,77],"types,":[56,78],"establish":[58,87],"essential":[59],"meta-theoretical":[60,89],"results":[61],"APCP,":[63],"most":[64],"notably":[65],"deadlock":[66],"freedom.":[67],"Second,":[68],"new":[72],"concurrent":[73],"$\\lambda$-calculus":[74],"with":[75],"dubbed":[79],"LASTn.":[80],"illustrate":[82],"LASTn":[83,114],"by":[84],"example":[85],"its":[88],"results;":[90],"particular,":[92],"show":[94],"how":[95],"to":[96],"soundly":[97],"transfer":[98],"guarantee":[101],"from":[102],"APCP.":[103],"To":[104],"this":[105],"end,":[106],"develop":[108],"translation":[110],"terms":[112],"into":[115],"APCP":[118],"satisfies":[120],"strong":[122],"formulation":[123],"operational":[125],"correspondence.":[126]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2024-10-08T00:00:00"}