{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:54:45Z","timestamp":1648860885972},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4076,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s1571-0661(04)80479-1","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T19:29:25Z","timestamp":1096399765000},"page":"238-253","source":"Crossref","is-referenced-by-count":0,"title":["Classes of Timed Automata and the Undecidability of Universality"],"prefix":"10.1016","volume":"65","author":[{"given":"Arnaldo V.","family":"Moura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilherme A.","family":"Pinto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A theory of timed automata","volume":"126","author":"Alur","year":"1994","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB2","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1006\/jcss.1998.1601","article-title":"Achilles and the tortoise climbing up the arithmetical hierarchy","volume":"57","author":"Asarin","year":"1998","journal-title":"J. of Comp. and Sys. Sci."},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0304-3975(98)00096-6","article-title":"Achilles and the tortoise climbing up the hyper-arithmetical hierarchy","volume":"210","author":"Bournez","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/malq.19890350406","article-title":"Nondeterministic \u03c9-computations and the analytical hierarchy","volume":"35","author":"Castro","year":"1989","journal-title":"Zeitschr.f.math. Logik und Grundlagen d. Math"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","article-title":"Theories of automata on \u03c9-tapes: A simplified approach","volume":"8","author":"Choueka","year":"1974","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB6","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1145\/210332.210339","article-title":"The complexity of probabilistic verification","volume":"42","author":"Courcoubetis","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB7","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0022-0000(83)90014-4","article-title":"Propositional dynamic logic of nonregular programs","volume":"26","author":"Harel","year":"1983","journal-title":"J. Comput. System Sci"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB8","first-page":"417","article-title":"The expressive power of clocks","author":"Henzinger","year":"1995","journal-title":"ICALP 1995"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/inco.1994.1045","article-title":"Symbolic model checking for real-time systems","volume":"111","author":"Henzinger","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB10","series-title":"Hybrid Systems'2000","first-page":"296","article-title":"Decidability and complexity results for timed automata and semi-linear hybrid automata","author":"Miller","year":"2000"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB11","unstructured":"Moura A. and G. Pinto, Classes of timed automata and the undecidability of universality, Technical Report IC-01-20, Institute of Computing, Univ. of Campinas (2001)."},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB12","unstructured":"Moura A. and G. Pinto, On almost deterministic timed automata, Technical Report IC-01-06, Institute of Computing, Univ. of Campinas (2001)."},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB13","series-title":"\u201cTheory of Recursive Functions and Effective Computability\u201d","author":"Rogers","year":"1987"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Safra S., On the complexity of \u03c9-automata, in: Proc. of the 29th IEEE Foundations of Computer Science, 1988, pp. 319\u2013327.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"10.1016\/S1571-0661(04)80479-1_NEWBIB15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0020-0190(89)90063-X","article-title":"On verifying that a concurrent program satisfies a nondeterministic specification","volume":"32","author":"Sistla","year":"1989","journal-title":"Information Proc. Letters"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804791?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804791?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T12:22:22Z","timestamp":1549196542000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S1571066104804791"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80479-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}