{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:11:52Z","timestamp":1765667512643,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031946332","type":"print"},{"value":"9783031946349","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-94634-9_6","type":"book-chapter","created":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T07:59:28Z","timestamp":1749283168000},"page":"109-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["High-Level Message Sequence Charts: Satisfiability and\u00a0Realizability Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0985-6115","authenticated-orcid":false,"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5278-0430","authenticated-orcid":false,"given":"Marie","family":"Fortin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1313-7722","authenticated-orcid":false,"given":"Paul","family":"Gastin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,8]]},"reference":[{"issue":"7","key":"6_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. Softw. Eng. 29(7), 623\u2013633 (2003). https:\/\/doi.org\/10.1109\/TSE.2003.1214326","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"6_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":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-77050-3_23","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"N Baudru","year":"2007","unstructured":"Baudru, N., Morin, R.: Synthesis of safe message-passing systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 277\u2013289. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77050-3_23"},{"key":"6_CR4","unstructured":"Bollig, B.: Automata and logics for message sequence charts. Ph.D. thesis, RWTH Aachen University (2005). https:\/\/d-nb.info\/975254936"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jcss.2020.06.006","volume":"115","author":"B Bollig","year":"2021","unstructured":"Bollig, B., Fortin, M., Gastin, P.: Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. J. Comput. Syst. Sci. 115, 22\u201353 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2020.06.006","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific (1995). https:\/\/doi.org\/10.1142\/2563","DOI":"10.1142\/2563"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11539452_34","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"B Genest","year":"2005","unstructured":"Genest, B.: On implementation of global concurrent systems with local asynchronous controllers. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 443\u2013457. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_34"},{"issue":"6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1016\/j.ic.2006.01.005","volume":"204","author":"B Genest","year":"2006","unstructured":"Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput. 204(6), 920\u2013956 (2006). https:\/\/doi.org\/10.1016\/j.ic.2006.01.005","journal-title":"Inf. Comput."},{"key":"6_CR9","unstructured":"Genest, B., Kuske, D., Muscholl, A.: On communicating automata with bounded channels. Fundam. Informaticae 80(1-3), 147\u2013167 (2007). http:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi80-1-3-09"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.jcss.2005.09.007","volume":"72","author":"B Genest","year":"2006","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level MSCs: model-checking and realizability. J. Comput. Syst. Sci. 72(4), 617\u2013647 (2006). https:\/\/doi.org\/10.1016\/j.jcss.2005.09.007","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s10009-002-0085-2","volume":"5","author":"EL Gunter","year":"2002","unstructured":"Gunter, E.L., Muscholl, A., Peled, D.: Compositional message sequence charts. Int. J. Softw. Tools Technol. Transfer 5(1), 78\u201389 (2002). https:\/\/doi.org\/10.1007\/s10009-002-0085-2","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Henriksen, J.G., Mukund, M., NarayanKumar, K., Sohoni, M.A., Thiagarajan, P.S.: A theory of regular MSC languages. Inf. Comput. 202(1), 1\u201338. https:\/\/doi.org\/10.1016\/j.ic.2004.08.004","DOI":"10.1016\/j.ic.2004.08.004"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. J. ACM 63(1), 9:1\u20139:67 (2016). https:\/\/doi.org\/10.1145\/2827695","DOI":"10.1145\/2827695"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0890-5401(03)00123-8","volume":"187","author":"D Kuske","year":"2003","unstructured":"Kuske, D.: Regular sets of infinite message sequence charts. Inf. Comput. 187(1), 80\u2013109 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00123-8","journal-title":"Inf. Comput."},{"issue":"1\u20133","key":"6_CR15","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.tcs.2003.08.002","volume":"309","author":"M Lohrey","year":"2003","unstructured":"Lohrey, M.: Realizability of high-level message sequence charts: closing the gaps. Theor. Comput. Sci. 309(1\u20133), 529\u2013554 (2003). https:\/\/doi.org\/10.1016\/j.tcs.2003.08.002","journal-title":"Theor. Comput. Sci."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-45841-7_43","volume-title":"STACS 2002","author":"R Morin","year":"2002","unstructured":"Morin, R.: Recognizable sets of message sequence charts. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 523\u2013534. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_43"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Stutz, F., Zufferey, D.: Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types. In: GandALF 2022. EPTCS, vol. 370, pp. 194\u2013212 (2022). https:\/\/doi.org\/10.4204\/EPTCS.370.13","DOI":"10.4204\/EPTCS.370.13"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-94634-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T07:59:29Z","timestamp":1749283169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-94634-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031946332","9783031946349"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-94634-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"8 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf-2025.petrinet.net","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}