{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:19:45Z","timestamp":1778851185714,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,12,16]],"date-time":"2014-12-16T00:00:00Z","timestamp":1418688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10703-014-0220-1","type":"journal-article","created":{"date-parts":[[2014,12,15]],"date-time":"2014-12-15T10:19:11Z","timestamp":1418638751000},"page":"42-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A game approach to determinize timed automata"],"prefix":"10.1007","volume":"46","author":[{"given":"Nathalie","family":"Bertrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Am\u00e9lie","family":"Stainer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"J\u00e9ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moez","family":"Krichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,16]]},"reference":[{"issue":"2","key":"220_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 DL (1994) A theory of timed automata. Theor Comput Sci 126(2):183\u2013235","journal-title":"Theor Comput Sci"},{"key":"220_CR2","doi-asserted-by":"crossref","unstructured":"Finkel O (2006) Undecidable problems about timed automata. In: Proceedings of the 4th international conference on formal modeling and analysis of timed systems (FORMATS\u201906) (Lecture Notes in Computer Science), vol 4202. Springer, pp. 187\u2013199","DOI":"10.1007\/11867340_14"},{"issue":"6","key":"220_CR3","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.ipl.2006.04.015","volume":"99","author":"S Tripakis","year":"2006","unstructured":"Tripakis S (2006) Folk theorems on the determinization and minimization of timed automata. Inf Process Lett 99(6):222\u2013226","journal-title":"Inf Process Lett"},{"key":"220_CR4","doi-asserted-by":"crossref","unstructured":"Asarin E, Maler O, Pnueli A, Sifakis J (1998) Controller synthesis for timed automata. In: Proceedings of the 5th IFAC symposium on system structure and control (SSSC\u201998). Elsevier Science, Amsterdam, pp. 469\u2013474","DOI":"10.1016\/S1474-6670(17)42032-5"},{"key":"220_CR5","doi-asserted-by":"crossref","unstructured":"Alur R, Fix L, Henzinger TA (1994) A determinizable class of timed automata. In: Proceedings of the 6th international conference on computer aided verification (CAV\u201994) (Lecture Notes in Computer Science), vol 818. Springer, New York, pp 1\u201313","DOI":"10.1007\/3-540-58179-0_39"},{"key":"220_CR6","unstructured":"Vijay SP, Pandya PK, Narayanan KS, Lakshmi M (2008) Timed automata with integer resets: language inclusion and expressiveness. In: Proceedings of the 6th international conference on formal modeling and analysis of timed systems (FORMATS\u201908) (Lecture Notes in Computer Science), vol 5215. Springer, pp. 78\u201392"},{"key":"220_CR7","unstructured":"Baier C, Bertrand N, Bouyer P, Brihaye T (2009) When are timed automata determinizable? In: Proceedings of the 36th international colloquium on automata, languages and programming (ICALP\u201909) (Lecture Notes in Computer Science), vol 5556. Springer, Rhodes, pp. 43\u201354"},{"issue":"3","key":"220_CR8","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/s10703-009-0065-1","volume":"34","author":"M Krichen","year":"2009","unstructured":"Krichen M, Tripakis S (2009) Conformance testing for real-time systems. Form Methods Syst Des 34(3):238\u2013304","journal-title":"Form Methods Syst Des"},{"key":"220_CR9","doi-asserted-by":"crossref","unstructured":"Bouyer P, Chevalier F, D\u2019Souza D (2005) Fault diagnosis using timed automata. In: Proceedings of the 8th international conference on foundations of software science and computational structures (FOSSACS\u201905) (Lecture Notes in Computer Science), vol 3441. Springer, San Diego, pp. 219\u2013233","DOI":"10.1007\/978-3-540-31982-5_14"},{"key":"220_CR10","doi-asserted-by":"crossref","unstructured":"Bertrand N, J\u00e9ron T, Stainer A, Krichen M (2012) Off-line test selection with test purposes for non-deterministic timed automata. Log Methods Comput Sci 8(4:8):1","DOI":"10.2168\/LMCS-8(4:8)2012"},{"key":"220_CR11","doi-asserted-by":"crossref","unstructured":"Bertrand N, Stainer A, J\u00e9ron T, Krichen M (2011) A game approach to determinize timed automata. In: Proceedings of the 14th international conference on foundations of software science and computation structures (FOSSACS\u201911) (Lecture Notes in Computer Science), vol 6604. Springer, pp. 245\u2013259.","DOI":"10.1007\/978-3-642-19805-2_17"},{"key":"220_CR12","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del E, Thomas W, Wilke T (2002) (eds) Automata, logics, and infinite games: a guide to current research (Lecture Notes in Computer Science), (vol 2500). Springer, Berlin","DOI":"10.1007\/3-540-36387-4"},{"key":"220_CR13","doi-asserted-by":"crossref","unstructured":"Bouyer P, Dufourd C, Fleury E, Petit A (2004) Updatable timed automata. Theor Comput Sci 321(2\u20133):291\u2013345","DOI":"10.1016\/j.tcs.2004.04.003"},{"key":"220_CR14","unstructured":"Lakshmi M, Narayanan KS (2010) Integer reset timed automata: clock reduction and determinizability. CoRR arXiv:1001.1215v1"},{"issue":"3","key":"220_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P Bouyer","year":"2004","unstructured":"Bouyer P (2004) Forward analysis of updatable timed automata. Form Methods Syst Des 24(3):281\u2013320","journal-title":"Form Methods Syst Des"},{"key":"220_CR16","doi-asserted-by":"crossref","unstructured":"Bertrand N, J\u00e9ron T, Stainer A, Krichen M (2011) Off-line test selection with test purposes for non-deterministic timed automata. In: Proceedings of the 17th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u201911) (Lecture Notes in Computer Science), vol 6605. Springer, pp. 96\u2013111","DOI":"10.1007\/978-3-642-19835-9_10"},{"key":"220_CR17","doi-asserted-by":"crossref","unstructured":"Alur R, Henzinger TA, Kupferman O, Vardi MY (1998) Alternating refinement relations. In: Proceedings of the 9th international conference on concurrency theory (CONCUR\u201998) (Lecture Notes in Computer Science), vol 1466. Springer, New York, pp 163\u2013178","DOI":"10.1007\/BFb0055622"},{"key":"220_CR18","doi-asserted-by":"crossref","unstructured":"David A, Larsen KG, Legay A, Nyman U, Wasowski A (2010) Timed i\/o automata: a complete specification theory for real-time systems. In: Proceedings of the 13th ACM international conference on hybrid systems: computation and control (HSCC\u201910). ACM, pp. 91\u2013100","DOI":"10.1145\/1755952.1755967"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-014-0220-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-014-0220-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-014-0220-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T12:48:24Z","timestamp":1566132504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-014-0220-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,16]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["220"],"URL":"https:\/\/doi.org\/10.1007\/s10703-014-0220-1","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,16]]}}}