{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T06:50:25Z","timestamp":1781938225546,"version":"3.54.5"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032283573","type":"print"},{"value":"9783032283580","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-28358-0_1","type":"book-chapter","created":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T06:01:28Z","timestamp":1781935288000},"page":"3-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Timed Scenario Expressions and\u00a0Realisability"],"prefix":"10.1007","author":[{"given":"Neda","family":"Saeedloei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feliks","family":"Klu\u017aniak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,21]]},"reference":[{"key":"1_CR1","unstructured":"Bejleri, A., Yoshida, N.: Synchronous multiparty session types. Electron. Notes Theoret. Comput. Sci. 241, 3\u201333 (2009). Proceedings of the First Workshop on Programming Language Approaches to Concurrency and Communication-centric Software (PLACES 2008)"},{"key":"1_CR2","first-page":"1","volume-title":"Formal Techniques for Distributed Systems","author":"G Castagna","year":"2011","unstructured":"Castagna, G., Dezani-Ciancaglini, M., Padovani, L.: On global types and multi-party sessions. In: Bruni, R., Dingel, J. (eds.) Formal Techniques for Distributed Systems, pp. 1\u201328. Springer, Berlin, Heidelberg (2011)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. J. ACM 63(1), 9:1\u20139:67 (2016)","DOI":"10.1145\/2827695"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"H\u00fcttel, H., et al.: Foundations of session types and behavioural contracts. ACM Comput. Surv. 49(1), 3:1\u20133:36 (2016)","DOI":"10.1145\/2873052"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-031-08143-9_8","volume-title":"Coordination Models and Languages","author":"F Barbanera","year":"2022","unstructured":"Barbanera, F., Lanese, I., Tuosto, E.: Formal choreographic languages. In: ter Beek, M.H., Sirjani, M. (eds.) Coordination Models and Languages, pp. 121\u2013139. Springer Nature Switzerland, Cham (2022)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-031-47963-2_15","volume-title":"Theoretical Aspects of Computing - ICTAC 2023","author":"MH ter Beek","year":"2023","unstructured":"ter Beek, M.H., Hennicker, R., Proen\u00e7a, J.: Realisability of global models of interaction. In: \u00c1brah\u00e1m, E., Dubslaff, C., Tarifa, S.L.T. (eds.) Theoretical Aspects of Computing - ICTAC 2023, pp. 236\u2013255. Springer Nature Switzerland, Cham (2023)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-03044-5_14","volume-title":"Formal Methods: Foundations and Applications","author":"N Saeedloei","year":"2018","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Timed Scenarios: Consistency, Equivalence and Optimization. In: Massoni, T., Mousavi, M.R. (eds.) SBMF 2018. LNCS, vol. 11254, pp. 215\u2013233. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03044-5_14"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Distributed timed scenarios. In: Damiani, F., Farrell, M. (eds.) Integrated Formal Methods - 20th International Conference, iFM 2025, Paris, France, November 19\u201321, 2025, Proceedings, Vol. 16194 of Lecture Notes in Computer Science, pp. 487\u2013508. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-10794-7_24","DOI":"10.1007\/978-3-032-10794-7_24"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49(1), 61\u201395 (1991)","journal-title":"Artif. Intell."},{"key":"1_CR10","first-page":"77","volume-title":"Message Sequence Charts","author":"D Harel","year":"2003","unstructured":"Harel, D., Thiagarajan, P.S.: Message Sequence Charts, pp. 77\u2013105. Springer, US, Boston, MA (2003)"},{"key":"1_CR11","unstructured":"ITU-T recommendation Z.120. Message Sequence Charts (MSC\u201996), ITU Telecommunication Standardization Sector (1996)"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s10703-012-0146-4","volume":"40","author":"S Balaguer","year":"2012","unstructured":"Balaguer, S., Chatain, T., Haar, S.: A concurrency-preserving translation from time petri nets to networks of timed automata. Formal Methods Syst. Des. 40(3), 330\u2013355 (2012)","journal-title":"Formal Methods Syst. Des."},{"issue":"7","key":"1_CR13","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)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Guanciale, R., Tuosto, E.: Realisability of pomsets. J. Logical Algebraic Methods Program. 108, 69\u201389 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2019.06.003","DOI":"10.1016\/j.jlamp.2019.06.003"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-031-62697-5_10","volume-title":"Coordination Models and Languages","author":"MH ter Beek","year":"2024","unstructured":"ter Beek, M.H., Hennicker, R., Proen\u00e7a, J.: Team automata: Overview and roadmap. In: Castellani, I., Tiezzi, F. (eds.) Coordination Models and Languages, pp. 161\u2013198. Springer Nature Switzerland, Cham (2024)"},{"issue":"2","key":"1_CR16","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(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika 30, 81\u201393 (1938)","journal-title":"Biometrika"}],"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-032-28358-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T06:01:31Z","timestamp":1781935291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28358-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032283573","9783032283580"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28358-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"21 June 2026","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 Models and Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Urbino","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2026\/coordination","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}