{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T09:22:27Z","timestamp":1765617747134,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,10]]},"DOI":"10.1145\/3756907.3756918","type":"proceedings-article","created":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T09:19:11Z","timestamp":1765617551000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Realisability and Complementability of Multiparty Session Types"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1563-6581","authenticated-orcid":false,"given":"Cinzia","family":"Di Giusto","sequence":"first","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur, CNRS, I3S, Nice, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8505-585X","authenticated-orcid":false,"given":"Etienne","family":"Lozes","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur, CNRS, I3S, Nice, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4300-543X","authenticated-orcid":false,"given":"Pascal","family":"Urso","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur, CNRS, I3S, Nice, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,12,13]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"IJsbrand\u00a0Jan Aalbersberg and Grzegorz Rozenberg. 1988. Theory of traces. Theoretical Computer Science 60 1 (1988) 1\u201382. 10.1016\/0304-3975(88)90051-5","DOI":"10.1016\/0304-3975(88)90051-5"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","unstructured":"Rajeev Alur Kousha Etessami and Mihalis Yannakakis. 2005. Realizability and verification of MSC graphs. Theor. Comput. Sci. 331 1 (2005) 97\u2013114. 10.1016\/J.TCS.2004.09.034","DOI":"10.1016\/J.TCS.2004.09.034"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007390"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/646485.759192"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3678232.3678245"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-94634-9_6"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Daniel Brand and Pitro Zafiropulo. 1983. On Communicating Finite-State Machines. J. ACM 30 2 (apr 1983) 323\u2013342. 10.1145\/322374.322380","DOI":"10.1145\/322374.322380"},{"key":"e_1_3_3_2_9_2","unstructured":"J.R. Buechi. 1962. On a decision method in restricted second-order arithmetic. Proc. Internat. Congr. Logic Methodology and Philosophy of Science 1 (1962) 1\u201312."},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18941-34"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_10"},{"key":"e_1_3_3_2_12_2","volume-title":"Realisability and complementability of multiparty session types","author":"Giusto Cinzia Di","year":"2025","unstructured":"Cinzia Di Giusto, \u00c9tienne Lozes, and Pascal Urso. 2025. Realisability and complementability of multiparty session types. Technical Report. Universit\u00e9 C\u00f4te d\u2019Azur. https:\/\/hal.science\/hal-05166255"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1142\/2563"},{"key":"e_1_3_3_2_14_2","unstructured":"Loic Germerie Guizouarn. 2023. Communicating automata and quasi-synchronous communications. Ph.\u00a0D. Dissertation. Universit\u00e9 C\u00f4te d\u2019Azur."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","unstructured":"Roberto Guanciale and Emilio Tuosto. 2019. Realisability of pomsets. J. Log. Algebraic Methods Program. 108 (2019) 69\u201389. 10.1016\/J.JLAMP.2019.06.003","DOI":"10.1016\/J.JLAMP.2019.06.003"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328472"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","unstructured":"Hans H\u00fcttel Ivan Lanese Vasco\u00a0T. Vasconcelos Lu\u00eds Caires Marco Carbone Pierre-Malo Deni\u00e9lou Dimitris Mostrous Luca Padovani Ant\u00f3nio Ravara Emilio Tuosto Hugo\u00a0Torres Vieira and Gianluigi Zavattaro. 2016. Foundations of Session Types and Behavioural Contracts. ACM Comput. Surv. 49 1 Article 3 (April 2016) 36\u00a0pages. 10.1145\/2873052","DOI":"10.1145\/2873052"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-37709-9_17"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","unstructured":"Markus Lohrey. 2003. Realizability of high-level message sequence charts: closing the gaps. Theor. Comput. Sci. 309 1-3 (2003) 529\u2013554. 10.1016\/J.TCS.2003.08.002","DOI":"10.1016\/J.TCS.2003.08.002"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","unstructured":"Alceste Scalas and Nobuko Yoshida. 2019. Less is more: multiparty session types revisited. Proc. ACM Program. Lang. 3 POPL (2019) 30:1\u201330:29. 10.1145\/3290343","DOI":"10.1145\/3290343"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ECOOP.2023.32"},{"key":"e_1_3_3_2_22_2","unstructured":"Felix Stutz. 2024. Implementability of Asynchronous Communication Protocols - The Power of Choice. Ph.\u00a0D. Dissertation. Kaiserslautern University of Technology Germany. https:\/\/kluedo.ub.rptu.de\/frontdoor\/index\/index\/docId\/8077"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57208-2_36"},{"key":"e_1_3_3_2_24_2","unstructured":"Jules Villard. 2011. Heaps and Hops. Ph.\u00a0D. Dissertation. \u00c9cole Normale Sup\u00e9rieure de Cachan."},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36987-3_5"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51237-3_22"}],"event":{"name":"PPDP '25: Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming","location":"Rende Italy","acronym":"PPDP '25"},"container-title":["Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3756907.3756918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T09:19:59Z","timestamp":1765617599000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3756907.3756918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,10]]},"references-count":25,"alternative-id":["10.1145\/3756907.3756918","10.1145\/3756907"],"URL":"https:\/\/doi.org\/10.1145\/3756907.3756918","relation":{},"subject":[],"published":{"date-parts":[[2025,9,10]]},"assertion":[{"value":"2025-12-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}