{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:39:31Z","timestamp":1743021571274,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319229744"},{"type":"electronic","value":"9783319229751"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-22975-1_19","type":"book-chapter","created":{"date-parts":[[2015,8,21]],"date-time":"2015-08-21T08:37:43Z","timestamp":1440146263000},"page":"288-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bounded Determinization of Timed Automata with Silent Transitions"],"prefix":"10.1007","author":[{"given":"Florian","family":"Lorber","sequence":"first","affiliation":[]},{"given":"Amnon","family":"Rosenmann","sequence":"additional","affiliation":[]},{"given":"Dejan","family":"Ni\u010dkovi\u0107","sequence":"additional","affiliation":[]},{"given":"Bernhard K.","family":"Aichernig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,22]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Bernhard, K.: Aichernig and florian lorber. Towards generation of adaptive test cases from partial models of determinized timed automata. In: AMOST (2015)","DOI":"10.1109\/ICSTW.2015.7107409"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-38916-0_2","volume-title":"Tests and Proofs","author":"BK Aichernig","year":"2013","unstructured":"Aichernig, B.K., Lorber, F., Ni\u010dkovi\u0107, D.: Time for mutants \u2014 model-based mutation testing with timed automata. In: Veanes, M., Vigan\u00f2, L. (eds.) TAP 2013. LNCS, vol. 7942, pp. 20\u201338. Springer, Heidelberg (2013)"},{"issue":"2","key":"19_CR3","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":"19_CR4","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, Part II. LNCS, vol. 5556, pp. 43\u201354. Springer, Heidelberg (2009)"},{"issue":"2\u20133","key":"19_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B B\u00e9rard","year":"1998","unstructured":"B\u00e9rard, B., Petit, A., Diekert, V., Gastin, P.: Characterization of the expressive power of silent transitions in timed automata. Fundam. Inform. 36(2\u20133), 145\u2013182 (1998)","journal-title":"Fundam. Inform."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-19835-9_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Bertrand","year":"2011","unstructured":"Bertrand, N., J\u00e9ron, T., Stainer, A., Krichen, M.: Off-line test selection with test purposes for non-deterministic timed automata. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 96\u2013111. Springer, Heidelberg (2011)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-19805-2_17","volume-title":"Foundations of Software Science and Computational Structures","author":"N Bertrand","year":"2011","unstructured":"Bertrand, N., Stainer, A., J\u00e9ron, T., Krichen, M.: A game approach to determinize timed automata. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 245\u2013259. Springer, Heidelberg (2011)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0065-2458(03)58003-2","volume":"58","author":"A Biere","year":"2003","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Advances in Computers 58, 117\u2013148 (2003)","journal-title":"Advances in Computers"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/11603009_10","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Bouyer","year":"2005","unstructured":"Bouyer, P., Laroussinie, F., Reynier, P.-A.: Diagonal constraints in timed automata: forward analysis of timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 112\u2013126. Springer, Heidelberg (2005)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Diekert, V., Gastin, P., Petit, A.: Removing epsilon-transitions in timed automata. In: STACS, pp. 583\u2013594. Springer (1997)","DOI":"10.1007\/BFb0023491"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/11867340_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"O Finkel","year":"2006","unstructured":"Finkel, O.: Undecidable problems about timed automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 187\u2013199. Springer, Heidelberg (2006)"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/s10703-009-0065-1","volume":"34","author":"M Krichen","year":"2009","unstructured":"Krichen, M., Tripakis, S.: Conformance testing for real-time systems. Formal Methods in System Design 34(3), 238\u2013304 (2009)","journal-title":"Formal Methods in System Design"},{"issue":"1\u20132","key":"19_CR14","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"KG Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a nutshell. STTT 1(1\u20132), 134\u2013152 (1997)","journal-title":"STTT"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Lorber, F., Rosenmann, A., Ni\u010dkovi\u0107, D., Aichernig, B.K.: Bounded determinization of timed automata with silent transitions. Technical Report IST-MBT-2015-01. Graz University of Technology, Institute for Software Technology (2015). https:\/\/goo.gl\/YTjjnF","DOI":"10.1007\/978-3-319-22975-1_19"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-61042-1_42","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Jan Tretmans","year":"1996","unstructured":"Tretmans, Jan: Test generation with inputs, outputs, and quiescence. In: Margaria, Tiziana, Steffen, Bernhard (eds.) TACAS 1996. LNCS, vol. 1055, pp. 127\u2013146. Springer, Heidelberg (1996)"},{"issue":"6","key":"19_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ipl.2006.04.015","volume":"99","author":"S Tripakis","year":"2006","unstructured":"Tripakis, S.: Folk theorems on the determinization and minimization of timed automata. Inf. Process. Lett. 99(6), 222\u2013226 (2006)","journal-title":"Inf. Process. Lett."},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-54862-8_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Wang","year":"2014","unstructured":"Wang, T., Sun, J., Liu, Y., Wang, X., Li, S.: Are timed automata bad for a specification language? language inclusion checking for timed automata. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014 (ETAPS). LNCS, vol. 8413, pp. 310\u2013325. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22975-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:47:49Z","timestamp":1674910069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22975-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319229744","9783319229751"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22975-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"22 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}