{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:02Z","timestamp":1725467402027},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648963"},{"type":"electronic","value":"9783540684558"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055641","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T03:31:00Z","timestamp":1153971060000},"page":"455-469","source":"Crossref","is-referenced-by-count":12,"title":["Controlled timed automata"],"prefix":"10.1007","author":[{"given":"Fran\u00c7ois","family":"Demichelis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wies\u0142aw","family":"Zielonka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking in real-time systems. Information and Computation, 104:2\u201334, 1993.","journal-title":"Information and Computation"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Rajeev Alur, Limor Fix, and Thomas A. Henzinger. A determinizable class of timed automata. In Proceedings of CAV'94, volume 818 of Lecture Notes in Comp. Sci., pages 1\u201313. Springer Verlag, 1994.","DOI":"10.1007\/3-540-58179-0_39"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Rajeev Alur and Thomas A. Henzinger. Back to the future: Towards a theory of timed regular languages. In Proceed. of 33th IEEE Symp. of Fundamentals of Computer Science, pages 177\u2013186, 1992.","DOI":"10.1109\/SFCS.1992.267774"},{"key":"30_CR5","unstructured":"Christian Choffrut and Massimiliano Goldwurm. Timed automata with periodic clock constraints. Technical report, University of Milano, 1998."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"V. Diekert, P. Gastin, and A. Petit. Removing \u025b-transitions in timed automata. In Proceedings of STACS'97, volume 1200 of Lecture Notes in Comp. Sci., pages 583\u2013594. Springer Verlag, 1997.","DOI":"10.1007\/BFb0023491"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"V. Gupta, T.A. Henzinger, and Rt. Jagadeesan. Robust timed automata. In Proceedings of HART'97, volume 1201 of Lecture Notes in Comp. Sci., pages 331\u2013345. Springer Verlag, 1997.","DOI":"10.1007\/BFb0014736"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger. The theory of hybrid automata. In Proceedings of LICS'96, pages 278\u2013292, 1996.","DOI":"10.1109\/LICS.1996.561342"},{"key":"30_CR9","unstructured":"Philippe Hermann. Automates temporis\u00e9s et reconnaissabilit\u00e9. M\u00e9moire de DEA, LIAFA, Universit\u00e9 Paris VII, 1997. extended version of [10]."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Philippe Hermann. Timed automata and recognizability. Information Processing Letters, 1998. to appear.","DOI":"10.1016\/S0020-0190(97)00217-2"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuven, editor, Handbook of Theoretical Computer Science, volume B, pages 133\u2013191. Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Th. Wilke. Specifying timed step sequences in powerful decidable logics and timed automata. In Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Comp. Sci. Springer Verlag, 1994.","DOI":"10.1007\/3-540-58468-4_191"}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T04:28:58Z","timestamp":1555734538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0055641","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}