{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T05:34:35Z","timestamp":1773293675021,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031353543","type":"print"},{"value":"9783031353550","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-35355-0_7","type":"book-chapter","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T18:03:11Z","timestamp":1686333791000},"page":"97-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Operations on\u00a0Timed Scenarios"],"prefix":"10.1007","author":[{"given":"Neda","family":"Saeedloei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feliks","family":"Klu\u017aniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,10]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","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","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.) FORTE 2004. LNCS, vol. 3235, pp. 213\u2013228. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30232-2_14"},{"key":"7_CR2","unstructured":"Greenyer, J.: Scenario-based modeling and programming of distributed systems. In: M. K\u00f6hler-Bussmeier, E. Kindler, H. R\u00f6lke (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":"7_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 1995, IEEE Computer Society, pp. 48\u201357 (1995)","DOI":"10.1109\/APSEC.1995.496953"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","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.) FORMATS 2006. LNCS, vol. 4202, pp. 98\u2013112. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11867340_8"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-31847-7_18","volume-title":"Formal Methods in Software and Systems Modeling","author":"D Harel","year":"2005","unstructured":"Harel, D., Kugler, H., Pnueli, A.: Synthesis revisited: generating statechart models from scenario-based requirements. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 309\u2013324. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31847-7_18"},{"issue":"2","key":"7_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":"7_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 (2007)","DOI":"10.1007\/978-3-540-74407-8_13"},{"key":"7_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, 2007, pp. 435\u2013450 (2007)","DOI":"10.1007\/978-3-540-71209-1_33"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","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.) HVC 2014. LNCS, vol. 8855, pp. 75\u201391. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13338-6_7"},{"key":"7_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 (2017)","DOI":"10.1007\/978-3-319-70848-5_4"},{"key":"7_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 (2018)","DOI":"10.1007\/978-3-030-03044-5_14"},{"issue":"2","key":"7_CR12","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":"7_CR13","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: a survey. In: Formal Methods for the Design of Real-Time Systems, International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM-RT, Revised Lectures, pp. 1\u201324 (2004)","DOI":"10.1007\/978-3-540-30080-9_1"},{"key":"7_CR14","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":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-92137-8_8","volume-title":"Formal Methods: Foundations and Applications","author":"N Saeedloei","year":"2021","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Minimization of the number of clocks for timed scenarios. In: Campos, S., Minea, M. (eds.) SBMF 2021. LNCS, vol. 13130, pp. 122\u2013139. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92137-8_8"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1007\/11523468_88","volume-title":"Automata, Languages and Programming","author":"PA Abdulla","year":"2005","unstructured":"Abdulla, P.A., Deneux, J., Ouaknine, J., Worrell, J.: Decidability and complexity results for timed automata via channel machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1089\u20131101. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_88"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-02930-1_4","volume-title":"Automata, Languages and Programming","author":"C Baier","year":"2009","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T.: When are timed automata determinizable? In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 43\u201354. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_4"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"DL Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197\u2013212. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52148-8_17"},{"key":"7_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":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and 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.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27755-2_3"},{"key":"7_CR21","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":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Daws","year":"1998","unstructured":"Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 313\u2013329. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054180"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","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.) CAV 1999. LNCS, vol. 1633, pp. 341\u2013353. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48683-6_30"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35355-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T01:38:57Z","timestamp":1729561137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35355-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031353543","9783031353550"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35355-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2023\/forte","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":"26","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":"13","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":"3","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":"50% - 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":"5","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)"}}]}}