{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:08Z","timestamp":1776333488689,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212980","type":"print"},{"value":"9783540247272","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_25","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:06:41Z","timestamp":1280747201000},"page":"348-362","source":"Crossref","is-referenced-by-count":19,"title":["On Recognizable Timed Languages"],"prefix":"10.1007","author":[{"given":"Oded","family":"Maler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Pnueli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Alur, R.: Techniques for Automatic Verification of Real-Time Systems, PhD Thesis, Stanford (1990)"},{"key":"25_CR2","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.: ATheory of Timed Automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R. Alur","year":"1999","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-Clock Automata: A Determinizable Class of Timed Automata. Theoretical Computer Science\u00a0211, 253\u2013273 (1999)","journal-title":"Theoretical Computer Science"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning Regular Sets from Queries and Counter-Examples. Information and Computation\u00a075, 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E. Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed Regular Expressions. The Journal of the ACM\u00a049, 172\u2013206 (2002)","journal-title":"The Journal of the ACM"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/3-540-36494-3_54","volume-title":"STACS 2003","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P.: Untameable timed automata! In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 620\u2013631. Springer, Heidelberg (2003)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-44612-5_19","volume-title":"Mathematical Foundations of Computer Science 2000","author":"P. Bouyer","year":"2000","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Expressiveness of updatable timed automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 232\u2013242. Springer, Heidelberg (2000)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0890-5401(03)00038-5","volume":"182","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., Petit, A., Th\u00e9rien, D.: An algebraic Approach to Data Languages and Timed Languages. Information and Computation\u00a0182, 137\u2013162 (2003)","journal-title":"Information and Computation"},{"key":"25_CR9","first-page":"3","volume":"6","author":"C. Dima","year":"2001","unstructured":"Dima, C.: Real-Time Automata. Journal of Automata, Languages and Combinatorics\u00a06, 3\u201324 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"25_CR10","first-page":"73","volume-title":"Proc. RTSS 1996","author":"C. Daws","year":"1996","unstructured":"Daws, C., Yovine, S.: Reducing the Number of Clock Variables of Timed Automata. In: Proc. RTSS 1996, pp. 73\u201381. IEEE, Los Alamitos (1996)"},{"key":"25_CR11","volume-title":"Automata, Languages and Machines, Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, Vol. A. Academic Press, New-York (1974)"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/0005-1098(72)90033-7","volume":"8","author":"E.M. Gold","year":"1972","unstructured":"Gold, E.M.: System Identification via State Characterization. Automatica\u00a08, 621\u2013636 (1972)","journal-title":"Automatica"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"Proc. ICALP 1998","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The Regular Real-time Languages. In: Proc. ICALP 1998. LNCS, vol.\u00a01343, pp. 580\u2013591. Springer, Heidelberg (1998)"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory Automata. Theoretical Computer Science\u00a0134, 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BFb0014711","volume-title":"Hybrid and Real-Time Systems","author":"J.-F. Raskin","year":"1997","unstructured":"Raskin, J.-F., Schobbens, P.-Y.: State Clock Logic:ADecidable Real-Time Logic. In: Maler, O. (ed.) HART 1997. LNCS, vol.\u00a01201, pp. 33\u201347. Springer, Heidelberg (1997)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Tripakis, S.: Folk Theorems on the Determinization and Minimization of Timed Automata. In: FORMATS 2003 (2003)","DOI":"10.1007\/978-3-540-40903-8_15"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-61648-9_38","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"J.G. Springintveld","year":"1996","unstructured":"Springintveld, J.G., Vaandrager, F.W.: Minimizable Timed Automata. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol.\u00a01135, pp. 130\u2013147. Springer, Heidelberg (1996)"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"T.. Wilke","year":"1994","unstructured":"Wilke, T.: Specifying State Sequences in Powerful Decidable Logics and Timed Automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863, pp. 694\u2013715. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:22:48Z","timestamp":1559344968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}