{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:14:41Z","timestamp":1775873681045,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031353604","type":"print"},{"value":"9783031353611","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-35361-1_12","type":"book-chapter","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T14:04:07Z","timestamp":1686751447000},"page":"214-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Safe Asynchronous Mixed-Choice for\u00a0Timed Interactions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4492-4072","authenticated-orcid":false,"given":"Jonah","family":"Pears","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7177-9395","authenticated-orcid":false,"given":"Laura","family":"Bocchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5806-4822","authenticated-orcid":false,"given":"Andy","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,15]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126, 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Bartoletti, M., Bocchi, L., Murgia, M.: Progress-Preserving refinements of CTA. In: CONCUR. Leibniz International Proceedings in Informatics, vol. 118, pp. 40:1\u201340:19. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.40","DOI":"10.4230\/LIPIcs.CONCUR.2018.40"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Bartoletti, M., Cimoli, T., Murgia, M.: Timed session types. logical methods in computer science 13(4) (2017). https:\/\/doi.org\/10.23638\/LMCS-13(4:25)2017","DOI":"10.23638\/LMCS-13(4:25)2017"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.4204\/EPTCS.166.9","volume":"166","author":"M Bartoletti","year":"2014","unstructured":"Bartoletti, M., Cimoli, T., Pinna, G.M.: A note on two notions of compliance. EPTCS 166, 86\u201393 (2014). https:\/\/doi.org\/10.4204\/EPTCS.166.9","journal-title":"EPTCS"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-76637-7_11","volume-title":"Programming Languages and Systems","author":"M Berger","year":"2007","unstructured":"Berger, M., Yoshida, N.: Timed, distributed, probabilistic, typed processes. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 158\u2013174. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76637-7_11"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-540-85361-9_33","volume-title":"CONCUR 2008 - Concurrency Theory","author":"L Bettini","year":"2008","unstructured":"Bettini, L., Coppo, M., D\u2019Antoni, L., De Luca, M., Dezani-Ciancaglini, M., Yoshida, N.: Global progress in dynamically interleaved multiparty sessions. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 418\u2013433. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_33"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Bocchi, L., Lange, J., Thompson, S., Voinea, A.L.: A model of actors and grey failures. In: COORDINATION. Lecture Notes in Computer Science, vol. 13271, pp. 140\u2013158. Springer-Verlag (2022). https:\/\/doi.org\/10.1007\/978-3-031-08143-9_9","DOI":"10.1007\/978-3-031-08143-9_9"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Bocchi, L., Langue, J., Yoshida, N.: Meeting deadlines together. In: CONCUR. Leibniz International Proceedings in Informatics, vol. 42, pp. 283\u2013296 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.283","DOI":"10.4230\/LIPIcs.CONCUR.2015.283"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Bocchi, L., Murgia, M., Vasconcelos, V.T., Yoshida, N.: Asynchronous timed session types: from duality to time-sensitive processes. In: ESOP. Lecture Notes in Computer Science, vol. 11423, pp. 583\u2013610. Springer-Verlag (2019). https:\/\/doi.org\/10.1007\/978-3-030-17184-1_21, https:\/\/kar.kent.ac.uk\/72337\/","DOI":"10.1007\/978-3-030-17184-1_21"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-662-44584-6_29","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"L Bocchi","year":"2014","unstructured":"Bocchi, L., Yang, W., Yoshida, N.: Timed multiparty session types. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 419\u2013434. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_29"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323\u2013342 (1983). https:\/\/doi.org\/10.1145\/322374.322380","journal-title":"J. ACM"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-85361-9_32","volume-title":"CONCUR 2008 - Concurrency Theory","author":"M Carbone","year":"2008","unstructured":"Carbone, M., Honda, K., Yoshida, N.: Structured interactional exceptions in session types. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 402\u2013417. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_32"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Castro, D., Hu, R., Jongmans, S.S., Ng, N., Yoshida, N.: Distributed programming using role-parametric session types in go: statically-typed endpoint APIs for dynamically-instantiated communication structures. In: POPL, vol. 3, pp. 1\u201330. ACM (2019). https:\/\/doi.org\/10.1145\/3290342","DOI":"10.1145\/3290342"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-28869-2_10","volume-title":"Programming Languages and Systems","author":"P-M Deni\u00e9lou","year":"2012","unstructured":"Deni\u00e9lou, P.-M., Yoshida, N.: Multiparty session types meet communicating automata. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 194\u2013213. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28869-2_10"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-39212-2_18","volume-title":"Automata, Languages, and Programming","author":"P-M Deni\u00e9lou","year":"2013","unstructured":"Deni\u00e9lou, P.-M., Yoshida, N.: Multiparty compatibility in communicating automata: characterisation and synthesis of global session types. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 174\u2013186. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_18"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-78663-4_18","volume-title":"Trustworthy Global Computing","author":"M Dezani-Ciancaglini","year":"2008","unstructured":"Dezani-Ciancaglini, M., de\u2019Liguoro, U., Yoshida, N.: On progress for structured communications. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 257\u2013275. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78663-4_18"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0019-9958(84)80014-5","volume":"63","author":"M Gouda","year":"1984","unstructured":"Gouda, M., Manning, E., Yu, Y.: On the progress of communication between two finite state machines. Inf. Control 63(3), 200\u2013216 (1984). https:\/\/doi.org\/10.1016\/S0019-9958(84)80014-5","journal-title":"Inf. Control"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: POPL, pp. 273\u2013284. ACM (2008). https:\/\/doi.org\/10.1145\/1328438.1328472","DOI":"10.1145\/1328438.1328472"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-540-70592-5_22","volume-title":"ECOOP 2008 \u2013 Object-Oriented Programming","author":"R Hu","year":"2008","unstructured":"Hu, R., Yoshida, N., Honda, K.: Session-based distributed programming in java. In: Vitek, J. (ed.) ECOOP 2008. LNCS, vol. 5142, pp. 516\u2013541. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70592-5_22"},{"key":"12_CR20","unstructured":"Klensin, J.: SMTP, Request for Comments: 5321 (2008). https:\/\/datatracker.ietf.org\/doc\/html\/rfc5321"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/11817963_24","volume-title":"Computer Aided Verification","author":"P Krcal","year":"2006","unstructured":"Krcal, P., Yi, W.: Communicating timed automata: the more synchronous, the more difficult to verify. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 249\u2013262. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_24"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-50029-0_8","volume-title":"Coordination Models and Languages","author":"N Lagaillardie","year":"2020","unstructured":"Lagaillardie, N., Neykova, R., Yoshida, N.: Implementing multiparty session types in rust. In: Bliudze, S., Bocchi, L. (eds.) COORDINATION 2020. LNCS, vol. 12134, pp. 127\u2013136. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50029-0_8"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Lagaillardie, N., Neykova, R., Yoshida, N.: Stay safe under panic: affine rust programming with multiparty session types. In: ECOOP. Leibniz International Proceedings in Informatics, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2022.4","DOI":"10.4230\/LIPIcs.ECOOP.2022.4"},{"key":"12_CR24","volume-title":"Communicating and Mobile systems - the Pi-Calculus","author":"R Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile systems - the Pi-Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Mostrous, D., Vasconcelos, V.T.: Affine Sessions. Logical Methods in Computer Science 14(4) (2018). https:\/\/doi.org\/10.23638\/LMCS-14(4:14)2018","DOI":"10.23638\/LMCS-14(4:14)2018"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Neykova, R.: Session types go dynamic or how to verify your Python conversations. EPTCS 137 (2013). https:\/\/doi.org\/10.4204\/EPTCS.137.8","DOI":"10.4204\/EPTCS.137.8"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Neykova, R., Hu, R., Yoshida, N., Abdeljallal, F.: A session type provider: compile-time API generation of distributed protocols with refinements in F#. In: CC, pp. 128\u2013138. ACM (2018). https:\/\/doi.org\/10.1145\/3178372.3179495","DOI":"10.1145\/3178372.3179495"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-40787-1_25","volume-title":"Runtime Verification","author":"R Neykova","year":"2013","unstructured":"Neykova, R., Yoshida, N., Hu, R.: SPY: local verification of global protocols. In: Legay, A., Bensalem, S. (eds.) RV 2013. LNCS, vol. 8174, pp. 358\u2013363. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40787-1_25"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-030-44914-8_26","volume-title":"Programming Languages and Systems","author":"VT Vasconcelos","year":"2020","unstructured":"Vasconcelos, V.T., Casal, F., Almeida, B., Mordido, A.: Mixed sessions. In: ESOP 2020. LNCS, vol. 12075, pp. 715\u2013742. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_26"},{"issue":"4","key":"12_CR30","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.entcs.2007.02.056","volume":"171","author":"N Yoshida","year":"2007","unstructured":"Yoshida, N., Vasconcelos, V.T.: Language primitives and type discipline for structured communication-based programming revisited: two systems for higher-order session communication. Electron. Notes Theor. Comput. Sci. 171(4), 73\u201393 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.02.056","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-86593-1_2","volume-title":"Fundamentals of Computation Theory","author":"N Yoshida","year":"2021","unstructured":"Yoshida, N., Zhou, F., Ferreira, F.: Communicating finite state machines and an extensible toolchain for\u00a0multiparty session types. In: Bampis, E., Pagourtzis, A. (eds.) FCT 2021. LNCS, vol. 12867, pp. 18\u201335. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86593-1_2"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35361-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T14:05:34Z","timestamp":1686751534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35361-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031353604","9783031353611"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35361-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Languages and Models","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2023\/coordination","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}