{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T23:24:58Z","timestamp":1768001098203,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319708478","type":"print"},{"value":"9783319708485","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-70848-5_4","type":"book-chapter","created":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T15:43:26Z","timestamp":1510328606000},"page":"33-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["From Scenarios to Timed Automata"],"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":[[2017,11,11]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"crossref","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":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-61042-1_37","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Alur","year":"1996","unstructured":"Alur, R., Holzmann, G.J., Peled, D.: An analyzer for message sequence charts. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 35\u201348. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61042-1_37"},{"key":"4_CR3","series-title":"IFIP","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35271-8_6","volume-title":"FORTE 1997","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.) FORTE 1997. IFIP, vol. 107. Springer, Boston (1997). https:\/\/doi.org\/10.1007\/978-0-387-35271-8_6"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Palopoli, L., Ramadian, Y.: Symbolic computation of schedulability regions using parametric timed automata. In: RTSS (2008)","DOI":"10.1109\/RTSS.2008.36"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-35746-6_1","volume-title":"Tools for Practical Software Verification","author":"EM Clarke","year":"2012","unstructured":"Clarke, E.M., Klieber, W., Nov\u00e1\u010dek, M., Zuliani, P.: Model checking and the state explosion problem. In: Meyer, B., Nordio, M. (eds.) LASER 2011. LNCS, vol. 7682, pp. 1\u201330. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35746-6_1"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Damas, C., Lambeau, B., Roucoux, F., van Lamsweerde, A.: Analyzing critical process models through behavior model synthesis. In: Proceedings of the 31st International Conference on Software Engineering, pp. 441\u2013451. IEEE Computer Society (2009)","DOI":"10.1109\/ICSE.2009.5070543"},{"key":"4_CR7","unstructured":"Giese, H.: Towards scenario-based synthesis for parametric timed automata. In: Proceedings of the 2nd International Workshop on Scenarios and State Machines: Models, Algorithms, and Tools (SCESM), Portland, USA (2003)"},{"issue":"2","key":"4_CR8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10515-014-0157-z","volume":"22","author":"CL Heitmeyer","year":"2015","unstructured":"Heitmeyer, C.L., Pickett, M., Leonard, E.I., Archer, M.M., Ray, I., Aha, D.W., Trafton, J.G.: Building high assurance human-centric decision systems. Autom. Softw. Eng. 22(2), 159\u2013197 (2015)","journal-title":"Autom. Softw. Eng."},{"issue":"1","key":"4_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/357062.357071","volume":"1","author":"T Lengauer","year":"1979","unstructured":"Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1(1), 121\u2013141 (1979)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9781420067859","volume-title":"Model-Based Design for Embedded Systems","author":"G Nicolescu","year":"2009","unstructured":"Nicolescu, G., Mosterman, P.J.: Model-Based Design for Embedded Systems, 1st edn. CRC Press Inc., Boca Raton (2009)","edition":"1"},{"key":"4_CR11","unstructured":"Rational Software: Unified Modeling Language, version 1.1, September 1997"},{"key":"4_CR12","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Clock allocation in timed automata and graph colouring. http:\/\/www2.cs.siu.edu\/~neda\/report3.pdf"},{"key":"4_CR13","unstructured":"Saeedloei, N., Klu\u017aniak, F.: Optimal clock allocation for a class of timed automata. http:\/\/www2.cs.siu.edu\/~neda\/report2.pdf"},{"key":"4_CR14","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, pp. 48\u201357. IEEE Computer Society (1995)","DOI":"10.1109\/APSEC.1995.496953"},{"issue":"3","key":"4_CR15","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TSE.2008.107","volume":"35","author":"S Uchitel","year":"2009","unstructured":"Uchitel, S., Brunet, G., Chechik, M.: Synthesis of partial behavior models from properties and scenarios. IEEE Trans. Softw. Eng. 35(3), 384\u2013406 (2009)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"4_CR16","doi-asserted-by":"crossref","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."}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70848-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T23:54:37Z","timestamp":1750982077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-70848-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319708478","9783319708485"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70848-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}