{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T17:31:48Z","timestamp":1781976708368,"version":"3.54.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032107930","type":"print"},{"value":"9783032107947","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"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-10794-7_24","type":"book-chapter","created":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T06:43:27Z","timestamp":1763189007000},"page":"487-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Timed Scenarios"],"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":[[2025,11,16]]},"reference":[{"key":"24_CR1","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":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-030-63882-5_8","volume-title":"Formal Methods: Foundations and Applications","author":"N Saeedloei","year":"2020","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Optimization of timed scenarios. In: Carvalho, G., Stolz, V. (eds.) SBMF 2020. LNCS, vol. 12475, pp. 119\u2013136. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63882-5_8"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-030-63461-2_15","volume-title":"Integrated Formal Methods","author":"N Saeedloei","year":"2020","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Synthesizing clock-efficient timed automata. In: Dongol, B., Troubitsyna, E. (eds.) IFM 2020. LNCS, vol. 12546, pp. 276\u2013294. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63461-2_15"},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Synthesizing timed automata with minimal numbers of clocks from optimised timed scenarios. In: Castiglioni, V., Francalanza, A. (eds.), Formal Techniques for Distributed Objects, Components, and Systems - 44th IFIP WG 6.1 International Conference, FORTE 2024, Held as part of the 19th International Federated Conference on Distributed Computing Techniques, DisCoTec 2024, Groningen, The Netherlands, 17-21 June 2024, Proceedings, vol. 14678, pp. 136\u2013154. LNCS, Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-62645-6_8","DOI":"10.1007\/978-3-031-62645-6_8"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-70848-5_4","volume-title":"Formal Methods: Foundations and Applications","author":"N Saeedloei","year":"2017","unstructured":"Saeedloei, N., Klu\u017aniak, F.: From scenarios to timed automata. In: Cavalheiro, S., Fiadeiro, J. (eds.) SBMF 2017. LNCS, vol. 10623, pp. 33\u201351. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70848-5_4"},{"issue":"1","key":"24_CR6","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":"24_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/b105972","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). https:\/\/doi.org\/10.1007\/b105972"},{"key":"24_CR8","unstructured":"ITU-T recommendation Z.120. Message Sequence Charts (MSC 1996) (1996). ITU Telecommunication Standardization Sector"},{"issue":"2","key":"24_CR9","first-page":"70","volume":"17","author":"R Alur","year":"1996","unstructured":"Alur, R., Holzmann, G.J., Peled, D.A.: An analyzer for message sequence charts. Software - Concepts and Tools 17(2), 70\u201377 (1996)","journal-title":"Software - Concepts and Tools"},{"issue":"7","key":"24_CR10","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":"24_CR11","series-title":"IFIP \u2014 The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-0-387-35271-8_6","volume-title":"Formal Description Techniques and Protocol Specification, Testing and Verification","author":"H Ben-Abdallah","year":"1997","unstructured":"Ben-Abdallah, H., Leue, S.: Timing constraints in message sequence chart specifications. In: Mizuno, T., Shiratori, N., Higashino, T., Togashi, A. (eds.) Formal Description Techniques and Protocol Specification, Testing and Verification. ITIFIP, pp. 91\u2013106. Springer, Boston, MA (1997). https:\/\/doi.org\/10.1007\/978-0-387-35271-8_6"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11867340_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Chandrasekaran","year":"2006","unstructured":"Chandrasekaran, P., Mukund, M.: Matching scenarios with timing constraints. In: Asarin, E., Bouyer, P. (eds.) Formal Modeling and Analysis of Timed Systems, pp. 98\u2013112. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11867340_8"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-77050-3_24","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"S Akshay","year":"2007","unstructured":"Akshay, S., Bollig, B., Gastin, P.: Automata and logics for timed message sequence charts. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 290\u2013302. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77050-3_24"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1011227529550","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"W Damm","year":"1999","unstructured":"Damm, W., Harel, D.: LSC\u2019s: breathing life into message sequence charts. In: Ciancarini, P., Fantechi, A., Gorrieri, R. (eds.) Formal Methods for Open Object-Based Distributed Systems, pp. 293\u2013311. Springer, US, Boston, MA (1999). https:\/\/doi.org\/10.1023\/A:1011227529550"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/3-540-45319-9_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Klose","year":"2001","unstructured":"Klose, J., Wittke, H.: An automata based interpretation of live sequence charts. In: Margaria, T., Yi, W. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 512\u2013527. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_35"},{"issue":"6","key":"24_CR16","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S1571-0661(04)80475-4","volume":"65","author":"P Lucas","year":"2002","unstructured":"Lucas, P.: Timed semantics of message sequence charts based on timed automata. Electron. Notes Theor. Comput. Sci. 65(6), 160\u2013179 (2002)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"24_CR17","unstructured":"Sun, J., Dong, J.S.: Model checking live sequence charts. In: 10th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2005), pp. 529\u2013538 (2005)"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0020949","volume-title":"Hybrid Systems III","author":"J Bengtsson","year":"1996","unstructured":"Bengtsson, J., Larsen, K., Larsson, F., Pettersson, P., Yi, W.: UPPAAL \u2014 a tool suite for automatic verification of real-time systems. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) HS 1995. LNCS, vol. 1066, pp. 232\u2013243. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0020949"},{"issue":"3","key":"24_CR19","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."},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Watanabe, K., Fainekos, G., Hoxha, B., Lahijanian, M., Prokhorov, D., Sankaranarayanan, S., Yamaguchi, T.: Timed partial order inference algorithm. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol.\u00a033, pp. 639\u2013647 (2023)","DOI":"10.1609\/icaps.v33i1.27246"},{"key":"24_CR21","unstructured":"Bejleri, A.,\u00a0Yoshida, N.: Synchronous multiparty session types. Electron. Notes Theor. Comput. Sci. 241, 3\u201333 (2009). In: Proceedings of the First Workshop on Programming Language Approaches to Concurrency and Communication-centric Software (PLACES 2008)"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-21461-5_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.) FMOODS\/FORTE -2011. LNCS, vol. 6722, pp. 1\u201328. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21461-5_1"},{"key":"24_CR23","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":"24_CR24","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":"24_CR25","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). https:\/\/doi.org\/10.1007\/978-3-031-47963-2_15"},{"key":"24_CR26","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). https:\/\/doi.org\/10.1007\/978-3-031-08143-9_8"},{"issue":"2","key":"24_CR27","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":"24_CR28","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Covering_relation"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Saeedloei, N.: On the existence of unions of timed scenarios. In: Nogueira, S.C.,\u00a0Teodorov, C., (eds.), Formal Methods: Foundations and Applications - 27th Brazilian Symposium, SBMF 2024, Vit\u00f3ria, Brazil, 4-6 December 2024, Proceedings, vol. 15403, pp. 3\u201321. LNCS, Springer (2024)","DOI":"10.1007\/978-3-031-78116-2_1"},{"issue":"7","key":"24_CR30","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"key":"24_CR31","doi-asserted-by":"publisher","unstructured":"Saeedloei, N.,\u00a0Klu\u017aniak, F.: Operations on timed scenarios. In:\u00a0Huisman, M.,\u00a0Ravara A., (eds.), Formal Techniques for Distributed Objects, Components, and Systems - 43rd IFIP WG 6.1 International Conference, FORTE 2023, Held as Part of the 18th International Federated Conference on Distributed Computing Techniques, DisCoTec 2023, Lisbon, Portugal, 19-23 June 2023, Proceedings, vol. 13910, pp. 97\u2013114. LNCS, Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-35355-0","DOI":"10.1007\/978-3-031-35355-0"},{"key":"24_CR32","unstructured":"Klu\u017aniak, F.: A tool-set for distributed timed scenarios. https:\/\/tigerweb.towson.edu\/nsaeedloei\/ (see Tools)"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10794-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T13:59:26Z","timestamp":1767967166000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10794-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,16]]},"ISBN":["9783032107930","9783032107947"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10794-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,16]]},"assertion":[{"value":"16 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","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":"19 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifm2025.ens.psl.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}