{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:35Z","timestamp":1725497195295},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009139"},{"type":"electronic","value":"9783540365808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36580-x_28","type":"book-chapter","created":{"date-parts":[[2007,12,9]],"date-time":"2007-12-09T07:13:36Z","timestamp":1197184416000},"page":"375-388","source":"Crossref","is-referenced-by-count":18,"title":["Universality and Language Inclusion for Open and Closed Timed Automata"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R. Alur","year":"1999","unstructured":"R. Alur, L. Fix, and T. A. Henzinger. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science, 211:253\u2013273, 1999.","journal-title":"Theoretical Computer Science"},{"key":"28_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/BFb0055642","volume-title":"Proceedings of CONCUR 98","author":"E. Asarin","year":"1998","unstructured":"E. Asarin, O. Maler, and A. Pnueli. On discretization of delays in timed automata and digital circuits. In Proceedings of CONCUR 98, volume 1466, pages 470\u2013484. Springer LNCS, 1998."},{"key":"28_CR4","unstructured":"D. Bosnacki. Digitization of timed automata. In Proceedings of FMICS 99, 1999."},{"key":"28_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-48168-0_10","volume-title":"Proceedings of CSL 99","author":"M. Fr\u00e4nzle","year":"1999","unstructured":"M. Fr\u00e4nzle. Analysis of Hybrid Systems: An ounce of realism can save an infinity of states. In Proceedings of CSL 99, volume 1683, pages 126\u2013140. Springer LNCS, 1999."},{"key":"28_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BFb0014736","volume-title":"Proceedings of HART 97","author":"V. Gupta","year":"1997","unstructured":"V. Gupta, T. A. Henzinger, and R. Jagadeesan. Robust timed automata. In Proceedings of HART 97, volume 1201, pages 331\u2013345. Springer LNCS, 1997."},{"key":"28_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/3-540-55719-9_103","volume-title":"Proceedings of ICALP 92","author":"T. A. Henzinger","year":"1992","unstructured":"T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proceedings of ICALP 92, volume 623, pages 545\u2013558. Springer LNCS, 1992."},{"key":"28_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-46430-1_15","volume-title":"Proceedings of HSCC 00","author":"T. A. Henzinger","year":"2000","unstructured":"T. A. Henzinger and J.-F. Raskin. Robust undecidability of timed and hybrid systems. In Proceedings of HSCC 00, volume 1790, pages 145\u2013159. Springer LNCS, 2000."},{"key":"28_CR9","unstructured":"J. Ouaknine and J. B. Worrell. Revisiting digitization, robustness, and decidability for timed automata. Submitted, 2003. Available from \n                    http:\/\/www.andrew.cmu.edu\/~joelo\n                    \n                  ."},{"key":"28_CR10","unstructured":"J. Ouaknine and J. B. Worrell. Timed CSP = closed timed Automata. Submitted, 2003. Available from \n                    http:\/\/www.andrew.cmu.edu\/~joelo\n                    \n                  ."}],"container-title":["Lecture Notes in Computer Science","Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36580-X_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T19:09:22Z","timestamp":1551208162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36580-X_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009139","9783540365808"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36580-x_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}