{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:25Z","timestamp":1753894405847,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We tackle the challenge of ensuring the deadlock-freedom property for\nmessage-passing processes that communicate asynchronously in cyclic process\nnetworks. Our contributions are twofold. First, we present Asynchronous\nPriority-based Classical Processes (APCP), a session-typed process framework\nthat supports asynchronous communication, delegation, and recursion in cyclic\nprocess networks. Building upon the Curry-Howard correspondences between linear\nlogic and session types, we establish essential meta-theoretical results for\nAPCP, most notably deadlock freedom. Second, we present a new concurrent\n$\\lambda$-calculus with asynchronous session types, dubbed LASTn. We illustrate\nLASTn by example and establish its meta-theoretical results; in particular, we\nshow how to soundly transfer the deadlock-freedom guarantee from APCP. To this\nend, we develop a translation of terms in LASTn into processes in APCP that\nsatisfies a strong formulation of operational correspondence.<\/jats:p>","DOI":"10.46298\/lmcs-20(4:6)2024","type":"journal-article","created":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T19:50:06Z","timestamp":1728330606000},"source":"Crossref","is-referenced-by-count":1,"title":["Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks"],"prefix":"10.46298","volume":"Volume 20, Issue 4","author":[{"given":"Bas van den","family":"Heuvel","sequence":"first","affiliation":[]},{"given":"Jorge A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2024,10,7]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/14412\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/14412\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T19:50:06Z","timestamp":1728330606000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(4:6)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2111.13091v5","asserted-by":"subject"},{"id-type":"arxiv","id":"2111.13091v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2111.13091v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2111.13091","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2111.13091","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2024,10,7]]},"article-number":"10128"}}