{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T22:38:52Z","timestamp":1767998332114,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031781155","type":"print"},{"value":"9783031781162","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"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-78116-2_1","type":"book-chapter","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T07:31:50Z","timestamp":1732779110000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Existence of Unions of Timed Scenarios"],"prefix":"10.1007","author":[{"given":"Neda","family":"Saeedloei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-30232-2_14","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2004","author":"A Salah","year":"2004","unstructured":"Salah, A., Mizouni, R., Dssouli, R., Parreaux, B.: Formal composition of distributed scenarios. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) Formal Techniques for Networked and Distributed Systems - FORTE 2004, pp. 213\u2013228. Springer Berlin Heidelberg, Berlin, Heidelberg (2004)"},{"key":"1_CR2","unstructured":"Greenyer, J.: Scenario-based modeling and programming of distributed systems. In: K\u00f6hler-Bussmeier, M., Kindler, E., R\u00f6lke, H. (eds.) Proceedings of the International Workshop on Petri Nets and Software Engineering 2021 Co-located with the 42nd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2021), Paris, France, June 25th, 2021 (due to COVID-19: virtual conference), Vol. 2907 of CEUR Workshop Proceedings, CEUR-WS.org, pp. 241\u2013252 (2021)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Som\u00e9, S., Dssouli, R., Vaucher, J.: From scenarios to timed automata: building specifications from users requirements. In: Proceedings of the Second Asia Pacific Software Engineering Conference, APSEC \u201995, IEEE Computer Society, pp. 48\u201357","DOI":"10.1109\/APSEC.1995.496953"},{"key":"1_CR4","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)"},{"key":"1_CR5","first-page":"309","volume-title":"Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements","author":"D Harel","year":"2005","unstructured":"Harel, D., Kugler, H., Pnueli, A.: Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements, pp. 309\u2013324. Springer, Berlin Heidelberg (2005)"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TSE.2003.1178048","volume":"29","author":"S Uchitel","year":"2003","unstructured":"Uchitel, S., Kramer, J., Magee, J.: Synthesis of behavioral models from scenarios. IEEE Trans. Softw. Eng. 29(2), 99\u2013115 (2003)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Akshay, S., Mukund, M., Kumar, K.N.: Checking coverage for infinite collections of timed scenarios. In: CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Proceedings, pp. 181\u2013196","DOI":"10.1007\/978-3-540-74407-8_13"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Bollig, B., Katoen, J., Kern, C., Leucker, M.: Replaying play in and play out: synthesis of design models from scenarios by learning. In: Proceedings of the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS, pp. 435\u2013450 (2007)","DOI":"10.1007\/978-3-540-71209-1_33"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-13338-6_7","volume-title":"Hardware and Software: Verification and Testing","author":"R Alur","year":"2014","unstructured":"Alur, R., Martin, M., Raghothaman, M., Stergiou, C., Tripakis, S., Udupa, A.: Synthesizing Finite-State Protocols from Scenarios and Requirements. In: Yahav, E. (ed.) Hardware and Software: Verification and Testing, pp. 75\u201391. Springer International Publishing, Cham (2014)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Saeedloei, N., Klu\u017aniak, F.: From scenarios to timed automata. In: Formal Methods: Foundations and Applications - 20th Brazilian Symposium, SBMF 2017, Proceedings, pp. 33\u201351","DOI":"10.1007\/978-3-319-70848-5_4"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Timed scenarios: consistency, equivalence and optimization. In: Formal Methods: Foundations and Applications - 21st Brazilian Symposium, SBMF 2018, Proceedings, pp. 215\u2013233","DOI":"10.1007\/978-3-030-03044-5_14"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Optimization of timed scenarios. In: Carvalho, G., Stolz, V. (eds.) Formal Methods: Foundations and Applications - 23rd Brazilian Symposium, SBMF 2020, Ouro Preto, Brazil, November 25\u201327, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12475, pp. 119\u2013136. Springer (2020)","DOI":"10.1007\/978-3-030-63882-5_8"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Operations on timed scenarios. In: Huisman, M., Ravara, 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, June 19\u201323, 2023, Proceedings. Lecture Notes in Computer Science, Vol. 13910, pp. 97\u2013114. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-35355-0_7","DOI":"10.1007\/978-3-031-35355-0_7"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Synthesizing timed automata with minimal numbers of clocks from optimized timed scenarios. In: Formal Techniques for Distributed Objects, Components, and Systems - International Conference, FORTE 2024, Proceedings, To appear","DOI":"10.1007\/978-3-031-62645-6_8"},{"issue":"2","key":"1_CR15","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_CR16","volume-title":"Model Checking","author":"EM Clarke Jr","year":"1999","unstructured":"Clarke, E.M., Jr., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Proceedings of the Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 1384, pp. 313\u2013329. Springer-Verlag (1998). https:\/\/doi.org\/10.1007\/BFb0054180","DOI":"10.1007\/BFb0054180"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Balarin, F.: Approximate reachability analysis of timed automata. In: 17th IEEE Real-Time Systems Symposium, pp. 52\u201361 (1996). https:\/\/doi.org\/10.1109\/REAL.1996.563700","DOI":"10.1109\/REAL.1996.563700"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: Efficient verification of real-time systems: compact data structure and state-space reduction. In: 18th IEEE Real-Time Systems Symposium, pp. 14\u201324 (1997)","DOI":"10.1109\/REAL.1997.641265"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/BFb0014737","volume-title":"Hybrid and Real-Time Systems","author":"E Asarin","year":"1997","unstructured":"Asarin, E., Bozga, M., Kerbrat, A., Maler, O., Pnueli, A., Rasse, A.: Data-structures for the verification of timed automata. In: Maler, O. (ed.) Hybrid and Real-Time Systems, pp. 346\u2013360. Springer Berlin Heidelberg, Berlin, Heidelberg (1997)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, pp. 197\u2013212. Springer-Verlag New York, Inc. (1990)","DOI":"10.1007\/3-540-52148-8_17"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-63166-6_19","volume-title":"Computer Aided Verification","author":"M Bozga","year":"1997","unstructured":"Bozga, M., Maler, O., Pnueli, A., Yovine, S.: Some progress in the symbolic verification of timed automata. In: Grumberg, O. (ed.) Computer Aided Verification, pp. 179\u2013190. Springer Berlin Heidelberg, Berlin, Heidelberg (1997)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Minimization of the number of clocks for timed scenarios. In: Campos, S., Minea, M. (eds.) Formal Methods: Foundations and Applications - 24th Brazilian Symposium, SBMF 2021 Proceedings. Lecture Notes in Computer Science, vol. 13130, pp. 122\u2013139. Springer (2021)","DOI":"10.1007\/978-3-030-92137-8_8"},{"key":"1_CR24","unstructured":"Saeedloei, N.: On the Existence of Unions of Timed Scenarios. https:\/\/tigerweb.towson.edu\/nsaeedloei\/thech-report-union.pdf"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets: Advances in Petri Nets","author":"J Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets: Advances in Petri Nets, pp. 87\u2013124. Springer Berlin Heidelberg, Berlin, Heidelberg (2004)"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-48683-6_30","volume-title":"Computer Aided Verification","author":"G Behrmann","year":"1999","unstructured":"Behrmann, G., Larsen, K.G., Pearson, J., Weise, C., Yi, W.: Efficient timed reachability analysis using clock difference diagrams. In: Halbwachs, N., Peled, D. (eds.) Computer Aided Verification, pp. 341\u2013353. Springer Berlin Heidelberg, Berlin, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78116-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T09:03:48Z","timestamp":1732784628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78116-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,29]]},"ISBN":["9783031781155","9783031781162"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78116-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,29]]},"assertion":[{"value":"29 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBMF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vit\u00f3ria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sbmf2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}