{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:27:09Z","timestamp":1770755229267,"version":"3.50.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031208713","type":"print"},{"value":"9783031208720","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20872-0_11","type":"book-chapter","created":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T08:03:10Z","timestamp":1667376190000},"page":"185-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Realisability of\u00a0Branching Pomsets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6011-9535","authenticated-orcid":false,"given":"Luc","family":"Edixhoven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4394-8745","authenticated-orcid":false,"given":"Sung-Shik","family":"Jongmans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,2]]},"reference":[{"issue":"7","key":"11_CR1","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/TSE.2003.1214326","volume":"29","author":"R Alur","year":"2003","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. IEEE Trans. Software Eng. 29(7), 623\u2013633 (2003). https:\/\/doi.org\/10.1109\/TSE.2003.1214326","journal-title":"IEEE Trans. Software Eng."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2004.09.034","volume":"331","author":"R Alur","year":"2005","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. Theor. Comput. Sci. 331(1), 97\u2013114 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.09.034","journal-title":"Theor. Comput. Sci."},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Basu, S., Bultan, T., Ouederni, M.: Deciding choreography realizability. In: Field, J., Hicks, M. (eds.) Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, 22\u201328 January 2012, pp. 191\u2013202. ACM (2012). https:\/\/doi.org\/10.1145\/2103656.2103680","DOI":"10.1145\/2103656.2103680"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-642-54833-8_26","volume-title":"Programming Languages and Systems","author":"L Bocchi","year":"2014","unstructured":"Bocchi, L., Melgratti, H., Tuosto, E.: Resolving non-determinism in choreographies. In: Shao, Z. (ed.) ESOP 2014. LNCS, vol. 8410, pp. 493\u2013512. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54833-8_26"},{"issue":"2","key":"11_CR5","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":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-01918-0_5","volume-title":"Formal Methods for Web Services","author":"M Carbone","year":"2009","unstructured":"Carbone, M., Yoshida, N., Honda, K.: Asynchronous session types: exceptions and multiparty interactions. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 187\u2013212. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01918-0_5"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Castagna, G., Dezani-Ciancaglini, M., Padovani, L.: On global types and multi-party session. Log. Methods Comput. Sci. 8(1) (2012). https:\/\/doi.org\/10.2168\/LMCS-8(1:24)2012","DOI":"10.2168\/LMCS-8(1:24)2012"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-030-21485-2_19","volume-title":"Models, Languages, and Tools for Concurrent and Distributed Programming","author":"I Castellani","year":"2019","unstructured":"Castellani, I., Dezani-Ciancaglini, M., Giannini, P.: Event structure semantics for multiparty sessions. In: Boreale, M., Corradini, F., Loreti, M., Pugliese, R. (eds.) Models, Languages, and Tools for Concurrent and Distributed Programming. LNCS, vol. 11665, pp. 340\u2013363. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21485-2_19"},{"issue":"7","key":"11_CR9","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00236-019-00332-y","volume":"56","author":"I Castellani","year":"2019","unstructured":"Castellani, I., Dezani-Ciancaglini, M., Giannini, P.: Reversible sessions with flexible choices. Acta Informatica 56(7), 553\u2013583 (2019). https:\/\/doi.org\/10.1007\/s00236-019-00332-y","journal-title":"Acta Informatica"},{"key":"11_CR10","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":"11_CR11","doi-asserted-by":"publisher","unstructured":"Deni\u00e9lou, P., Yoshida, N., Bejleri, A., Hu, R.: Parameterised multiparty session types. Log. Methods Comput. Sci. 8(4) (2012). https:\/\/doi.org\/10.2168\/LMCS-8(4:6)2012","DOI":"10.2168\/LMCS-8(4:6)2012"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Edixhoven, L., Jongmans, S.S.: Realisability of branching pomsets (technical report), Tech. Rep. OUNL-CS-2022-05, Open University of the Netherlands (2022)","DOI":"10.1007\/978-3-031-20872-0_11"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Edixhoven, L., Jongmans, S.S., Proen\u00e7a, J., Cledou, G.: Branching pomsets for choreographies. In: Proceedings 15th Interaction and Concurrency Experience, ICE 2022, Lucca, Italy, 17 June 2022, EPTCS (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.04632","DOI":"10.48550\/arXiv.2208.04632"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3540539816_56","volume-title":"TAPSOFT \u201991","author":"GL Ferrari","year":"1991","unstructured":"Ferrari, G.L., Gorrieri, R., Montanari, U.: An extended expansion theorem. In: Abramsky, S., Maibaum, T.S.E. (eds.) TAPSOFT 1991. LNCS, vol. 494, pp. 29\u201348. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3540539816_56"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Finkel, A., Lozes, \u00c9.: Synchronizability of communicating finite state machines is not decidable. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, 10\u201314 July 2017, Warsaw, Poland. LIPIcs, vol. 80, pp. 1\u201314. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.122","DOI":"10.4230\/LIPIcs.ICALP.2017.122"},{"issue":"1\u20132","key":"11_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2004.07.004","volume":"328","author":"X Fu","year":"2004","unstructured":"Fu, X., Bultan, T., Su, J.: Conversation protocols: a formalism for specification and verification of reactive electronic services. Theor. Comput. Sci. 328(1\u20132), 19\u201337 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.07.004","journal-title":"Theor. Comput. Sci."},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Guanciale, R., Tuosto, E.: An abstract semantics of the global view of choreographies. In: Bartoletti, M., Henrio, L., Knight, S., Vieira, H.T. (eds.) Proceedings 9th Interaction and Concurrency Experience, ICE 2016, Heraklion, Greece, 8\u20139 June 2016. EPTCS, vol. 223, pp. 67\u201382 (2016). https:\/\/doi.org\/10.4204\/EPTCS.223.5","DOI":"10.4204\/EPTCS.223.5"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.jlamp.2019.06.003","volume":"108","author":"R Guanciale","year":"2019","unstructured":"Guanciale, R., Tuosto, E.: Realisability of pomsets. J. Log. Algebraic Methods Program. 108, 69\u201389 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2019.06.003","journal-title":"J. Log. Algebraic Methods Program."},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM 32(1), 137\u2013161 (1985). https:\/\/doi.org\/10.1145\/2455.2460","journal-title":"J. ACM"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: Necula, G.C., Wadler, P. (eds.) Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, 7\u201312 January 2008. pp. 273\u2013284. ACM (2008). https:\/\/doi.org\/10.1145\/1328438.1328472","DOI":"10.1145\/1328438.1328472"},{"key":"11_CR21","unstructured":"ITU-TS: ITU-TS Recommendation Z.120: Message Sequence Chart 2011 (MSC11). Tech. rep., ITU-TS, Geneva (2011)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-44914-8_10","volume-title":"Programming Languages and Systems","author":"S-S Jongmans","year":"2020","unstructured":"Jongmans, S.-S., Yoshida, N.: Exploring type-level bisimilarity towards more expressive multiparty session types. In: ESOP 2020. LNCS, vol. 12075, pp. 251\u2013279. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_10"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.jlamp.2018.12.001","volume":"103","author":"T Kapp\u00e9","year":"2019","unstructured":"Kapp\u00e9, T., Brunet, P., Luttik, B., Silva, A., Zanasi, F.: On series-parallel pomset languages: rationality, context-freeness and automata. J. Log. Algebraic Methods Program. 103, 130\u2013153 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2018.12.001","journal-title":"J. Log. Algebraic Methods Program."},{"key":"11_CR24","unstructured":"Katoen, J., Lambert, L.: Pomsets for MSC. In: K\u00f6nig, H., Langend\u00f6rfer, P. (eds.) Formale Beschreibungstechniken f\u00fcr verteilte Systeme, 8. GI\/ITG-Fachgespr\u00e4ch, Cottbus, 4. und 5. Juni 1998. pp. 197\u2013207. Verlag Shaker (1998)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-14458-5_7","volume-title":"Web Services and Formal Methods","author":"N Lohmann","year":"2010","unstructured":"Lohmann, N., Wolf, K.: Realizability is controllability. In: Laneve, C., Su, J. (eds.) WS-FM 2009. LNCS, vol. 6194, pp. 110\u2013127. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14458-5_7"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comput. Sci. 13, 85\u2013108 (1981). https:\/\/doi.org\/10.1016\/0304-3975(81)90112-2","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"VR Pratt","year":"1986","unstructured":"Pratt, V.R.: Modeling concurrency with partial orders. Int. J. Parallel Program. 15(1), 33\u201371 (1986). https:\/\/doi.org\/10.1007\/BF01379149","journal-title":"Int. J. Parallel Program."},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Sangiorgi, D.: Introduction to bisimulation and coinduction. Cambridge University Press (2011). https:\/\/doi.org\/10.1017\/CBO9780511777110","DOI":"10.1017\/CBO9780511777110"},{"key":"11_CR30","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - a theory of mobile processes. Cambridge University Press (2001)"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Scalas, A., Yoshida, N.: Less is more: multiparty session types revisited. Proc. ACM Program. Lang. 3(POPL), 1\u201329 (2019). https:\/\/doi.org\/10.1145\/3290343","DOI":"10.1145\/3290343"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-39951-1_16","volume-title":"Foundations of Information and Knowledge Systems","author":"K-D Schewe","year":"2020","unstructured":"Schewe, K.-D., A\u00eft-Ameur, Y., Benyagoub, S.: Realisability of choreographies. In: Herzig, A., Kontinen, J. (eds.) FoIKS 2020. LNCS, vol. 12012, pp. 263\u2013280. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39951-1_16"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20872-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T23:32:00Z","timestamp":1678491120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20872-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031208713","9783031208720"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20872-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"2 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FACS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Aspects of Component Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"facs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/facs-conference.github.io\/2022\/","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":"25","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":"1","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":"48% - 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)"}}]}}