{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:36:56Z","timestamp":1649122616969},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00269-9","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"191-204","source":"Crossref","is-referenced-by-count":1,"title":["Augmenting the discrete timed automaton with other data structures"],"prefix":"10.1016","volume":"289","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwen","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(01)00269-9_BIB1","first-page":"83","article-title":"Automata for modeling real-time systems","volume":"126","author":"Alur","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00269-9_BIB2","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, R. Echahed, R. Robbana, in: P.J. Antsalilis, W. Kohn, M.O. Lemmon, A.N. Nerode, S. Sastry (Eds.) On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures, In Hybrid Systems II, Lecture Notes in Computer Science, Vol. 999, Springer, Berlin, 1995.","DOI":"10.1007\/3-540-60472-3_4"},{"issue":"3","key":"10.1016\/S0304-3975(01)00269-9_BIB3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1142\/S0129054196000191","article-title":"Multi-push-down languages and grammars","volume":"7","author":"Cherubini","year":"1996","journal-title":"Int. J. Foundations Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00269-9_BIB4","doi-asserted-by":"crossref","unstructured":"H. Comon, Y. Jurski, Multiple counters automata, safety analysis and Presburger arithmetic, Proc. 10th Int. Conf. on Computer Aided Verification, 1998, pp. 268\u2013279.","DOI":"10.1007\/BFb0028751"},{"key":"10.1016\/S0304-3975(01)00269-9_BIB5","doi-asserted-by":"crossref","unstructured":"H. Comon, Y. Jurski, Timed automata and the theory of real numbers, Proc. 10th Int. Conf. on Concurrency Theory, 1999, pp. 242\u2013257.","DOI":"10.1007\/3-540-48320-9_18"},{"key":"10.1016\/S0304-3975(01)00269-9_BIB6","unstructured":"Z. Dang, Verification and Debugging of Infinite State Real-time Systems, Ph.D. Thesis, University of California, Santa Barbara, 2000."},{"key":"10.1016\/S0304-3975(01)00269-9_BIB7","doi-asserted-by":"crossref","unstructured":"Z. Dang, O.H. Ibarra, T. Bultan, R.A. Kemmerer, J. Su, Binary reachability analysis of discrete pushdown timed automata, Int. Conf. on Computer Aided Verification, 2000, pp. 69\u201384.","DOI":"10.1007\/10722167_9"},{"issue":"1","key":"10.1016\/S0304-3975(01)00269-9_BIB8","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"Ibarra","year":"1978","journal-title":"J. Assoc. Comput. Machin."},{"key":"10.1016\/S0304-3975(01)00269-9_BIB9","doi-asserted-by":"crossref","unstructured":"O.H. Ibarra, T. Bultan, J. Su, Reachability analysis for some models of infinite-state transition systems, Proc. 10th Int. Conf. on Concurrency Theory, 2000, pp. 183\u2013198.","DOI":"10.1007\/3-540-44618-4_15"},{"key":"10.1016\/S0304-3975(01)00269-9_BIB10","unstructured":"O.H. Ibarra, Z. Dang, P. San Pietro, Queue-Connected Discrete Timed Automata, Theoret. Comput. Sci., submitted for publication."},{"key":"10.1016\/S0304-3975(01)00269-9_BIB11","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of Tag and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002699?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002699?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T17:54:20Z","timestamp":1583776460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501002699"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00269-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}