{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T22:21:18Z","timestamp":1767997278104,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031626449","type":"print"},{"value":"9783031626456","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-62645-6_8","type":"book-chapter","created":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T05:01:51Z","timestamp":1718168511000},"page":"136-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Synthesizing Timed Automata with\u00a0Minimal Numbers of\u00a0Clocks from\u00a0Optimised Timed Scenarios"],"prefix":"10.1007","author":[{"given":"Neda","family":"Saeedloei","sequence":"first","affiliation":[]},{"given":"Feliks","family":"Klu\u017aniak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,13]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68855-6","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2008","year":"2008","unstructured":"Suzuki, K., Higashino, T., Yasumoto, K., El-Fakih, K. (eds.): FORTE 2008. LNCS, vol. 5048. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68855-6"},{"key":"8_CR2","unstructured":"Greenyer, J.: Scenario-based modeling and programming of distributed systems, In: M.\u00a0K\u00f6hler-Bussmeier, E.\u00a0Kindler, H.\u00a0R\u00f6lke (Eds.), In: 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":"8_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","DOI":"10.1109\/APSEC.1995.496953"},{"key":"8_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":"8_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"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Uchitel, S., Kramer, J., Magee, J.: Synthesis of behavioral models from scenarios. IEEE Trans. Softw. Eng. 29(2), 99\u2013115 (2003)","DOI":"10.1109\/TSE.2003.1178048"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-74407-8_13","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"S Akshay","year":"2007","unstructured":"Akshay, S., Mukund, M., Kumar, K.N.: Checking coverage for infinite collections of timed scenarios. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 181\u2013196. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74407-8_13"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-540-71209-1_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Bollig","year":"2007","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M.: Replaying play in and play out: synthesis of design models from scenarios by learning. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 435\u2013450. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_33"},{"key":"8_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":"8_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":"8_CR11","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":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: a survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1\u201324. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30080-9_1"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92137-8","volume-title":"Formal Methods: Foundations and Applications","year":"2021","unstructured":"Campos, S., Minea, M. (eds.): SBMF 2021. LNCS, vol. 13130. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92137-8"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Operations on timed scenarios. In: M.\u00a0Huisman, A.\u00a0Ravara (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-23, 2023, Proceedings, Vol. 13910 of Lecture Notes in Computer Science, Springer, pp. 97\u2013114 (2023) https:\/\/doi.org\/10.1007\/978-3-031-35355-0_7","DOI":"10.1007\/978-3-031-35355-0_7"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"8_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":"8_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":"8_CR18","doi-asserted-by":"publisher","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Optimization of timed scenarios. In: G.\u00a0Carvalho, V.\u00a0Stolz (Eds.), Formal Methods: Foundations and Applications - 23rd Brazilian Symposium, SBMF 2020, Ouro Preto, Brazil, November 25-27, 2020, Proceedings, Vol. 12475 of Lecture Notes in Computer Science, Springer, pp. 119\u2013136 (2020) https:\/\/doi.org\/10.1007\/978-3-031-22476-8","DOI":"10.1007\/978-3-031-22476-8"},{"key":"8_CR19","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":"8_CR20","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Observations about timed scenarios. https:\/\/tigerweb.towson.edu\/nsaeedloei\/Observations.pdf"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Clock allocation in timed automata and graph colouring. In: Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week), HSCC 2018, pp. 71\u201380. https:\/\/doi.org\/10.1145\/3178126.3178138","DOI":"10.1145\/3178126.3178138"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"N.\u00a0Saeedloei, F.\u00a0Klu\u017aniak, Synthesizing clock-efficient timed automata, in: B.\u00a0Dongol, E.\u00a0Troubitsyna (Eds.), Integrated Formal Methods - 16th International Conference, IFM 2020, Lugano, Switzerland, November 16-20, 2020, Proceedings, Vol. 12546 of Lecture Notes in Computer Science, Springer, 2020, pp. 276\u2013294. https:\/\/doi.org\/10.1007\/978-3-031-07727-2","DOI":"10.1007\/978-3-031-07727-2"}],"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-62645-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T17:01:09Z","timestamp":1732208469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62645-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031626449","9783031626456"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62645-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 June 2024","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":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"17 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}