{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T16:48:05Z","timestamp":1791046085800,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540265467","type":"print"},{"value":"9783540316824","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11505877_24","type":"book-chapter","created":{"date-parts":[[2010,9,26]],"date-time":"2010-09-26T13:40:25Z","timestamp":1285508425000},"page":"272-283","source":"Crossref","is-referenced-by-count":9,"title":["On Timed Automata with Discrete Time \u2013 Structural and Language Theoretical Characterization"],"prefix":"10.1007","author":[{"given":"Hermann","family":"Gruber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Astrid","family":"Kiehn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"24_CR1","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.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Real-Time: Theory in Practice","author":"R. Alur","year":"1992","unstructured":"Alur, R., Henzinger, T.: Logics and models of real time: a survey. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol.\u00a0600, Springer, Heidelberg (1992)"},{"key":"24_CR3","first-page":"106","volume":"83","author":"E. Asarin","year":"2004","unstructured":"Asarin, E.: Challenges in timed languages: From applied theory to basic theory? EATCS Bulletin\u00a083, 106\u2013120 (2004); Appeared in The Concurrency Column","journal-title":"EATCS Bulletin"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BFb0053543","volume-title":"Foundations of Software Science and Computation Structures","author":"D. Beauquier","year":"1998","unstructured":"Beauquier, D.: Pumping lemmas for timed automata. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 81\u201394. Springer, Heidelberg (1998)"},{"issue":"2- 3","key":"24_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B. Berard","year":"1998","unstructured":"Berard, B., Petit, A., Diekert, V., Gastin, P.: Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae\u00a036(2- 3), 145\u2013182 (1998)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"24_CR6","first-page":"371","volume":"5","author":"C. Choffrut","year":"2000","unstructured":"Choffrut, C., Goldwurm, M.: Timed automata with periodic clock constraints. Journal of Automata, Languages and Combinatorics\u00a05(4), 371\u2013404 (2000)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-60084-1_93","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"1995","unstructured":"Henzinger, T.A., Kopke, P.W., Wong-Toi, H.: The expressive power of clocks. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, pp. 417\u2013428. Springer, Heidelberg (1995)"},{"key":"24_CR8","unstructured":"Pnueli, A., Vardi, M.: Automata-theoretic approach to automated verification \u2013 lecture notes (1999), http:\/\/www.cs.rice.edu\/~ardi\/av.html"},{"key":"24_CR9","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 time state sequences in powerful 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","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11505877_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:50:32Z","timestamp":1591923032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11505877_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265467","9783540316824"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11505877_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}