{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:10Z","timestamp":1760202490034},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":3760,"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":[[2003,4]]},"DOI":"10.1016\/s0304-3975(02)00545-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"687-706","source":"Crossref","is-referenced-by-count":3,"title":["Eliminating the storage tape in reachability constructions"],"prefix":"10.1016","volume":"299","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(02)00545-5_BIB1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1006\/inco.1996.0053","article-title":"Verifying programs with unreliable channels","volume":"127","author":"Abdulla","year":"1996","journal-title":"Inform. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(02)00545-5_BIB2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"The theory of timed automata","volume":"126","author":"Alur","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB3","unstructured":"A. Bouajjani, J. Esparza, O. Maler, Reachability analysis of pushdown automata: application to model-checking, CONCUR\u201997, Lecture Notes in Computer Science, Vol. 1243, Springer, Berlin, pp. 135\u2013150."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB4","unstructured":"G. Cece, A. Finkel, Programs with quasi-stable channels are effectively recognizable, CAV\u201997, Lecture Notes in Computer Science, Vol. 1254, Springer, Berlin, pp. 304\u2013315."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB5","unstructured":"H. Comon, V. Cortier, Flatness is not a weakness, VCL\u201900, Lecture Notes in Computer Science, Vol. 1862, Springer, Berlin, pp. 262\u2013276."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB6","unstructured":"H. Comon, Y. Jurski, Multiple counters automata, safety analysis and Presburger arithmetic, CAV\u201998, Lecture Notes in Computer Science, Vol. 1427, Springer, Berlin, pp. 268\u2013279."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB7","unstructured":"Z. Dang, Binary reachability analysis of timed pushdown automata with dense clocks, CAV\u201901, Lecture Notes in Computer Science, Vol. 2102, Springer, Berlin, pp. 506\u2013517."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB8","unstructured":"Z. Dang, O.H. Ibarra, Liveness verification of reversal-bounded counter machines with a free counter, FSTTCS\u201901, Lecture Notes in Computer Science, Vol. 2245, Springer, Berlin, pp. 132\u2013243."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB9","unstructured":"Z. Dang, O.H. Ibarra, T. Bultan, R.A. Kemmerer, J. Su, Binary reachability analysis of discrete pushdown timed automata, CAV\u201900, Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, pp. 69\u201384."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB10","unstructured":"Z. Dang, P. San Pietro, R.A. Kemmerer, On Presburger liveness of discrete timed automata, STACS\u201901, Lecture Notes in Computer Science, Vol. 2010, Springer, Berlin, pp. 132\u2013143."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB11","unstructured":"J. Esparza, D. Hansel, P. Rossmanith, S. Schwoon, Efficient algorithms for model checking pushdown systems, CAV\u201900, Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, pp. 232\u2013247."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB12","unstructured":"A. Finkel, G. Sutre, Decidability of reachability problems for classes of two counter automata, STACS\u201900, Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, pp. 346\u2013357."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB13","doi-asserted-by":"crossref","unstructured":"A. Finkel, B. Willems, P. Wolper, A direct symbolic approach to model checking pushdown systems, Electronic Notes in Theoretical Computer Science, Vol. 9, Elsevier, Amsterdam, 2000.","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"10.1016\/S0304-3975(02)00545-5_BIB14","first-page":"333","article-title":"Bounded algol-like languages","volume":"113","author":"Ginsburg","year":"1964","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB15","unstructured":"T. Harju, O.H. Ibarra, J. Karhumaki, A. Salomaa, Decision questions concerning semilinearity, morphisms and commutation of languages, ICALP\u201901, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, PP. 579\u2013590."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB16","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. ACM"},{"key":"10.1016\/S0304-3975(02)00545-5_BIB17","unstructured":"O.H. Ibarra, Reachability and safety in queue systems with counters and pushdown stack, Proc. Internat. Conf. on Implementation and Application of Automata, 2000, pp. 120\u2013129."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB18","doi-asserted-by":"crossref","unstructured":"O.H. Ibarra, T. Bultan, J. Su, Reachability analysis for some models of infinite-state transition systems, Proc. 10th Internat. Conf. on Concurrency Theory, 2000, pp. 183\u2013198.","DOI":"10.1007\/3-540-44618-4_15"},{"key":"10.1016\/S0304-3975(02)00545-5_BIB19","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1016\/S0304-3975(02)00076-2","article-title":"Verification in loosely synchronous queue-connected discrete timed automata","volume":"290","author":"Ibarra","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB20","doi-asserted-by":"crossref","unstructured":"O.H. Ibarra, J. Su, Generalizing the discrete timed automaton, Proc. Internat. Conf. on Implementation and Application of Automata, 2000, pp. 206\u2013215.","DOI":"10.1007\/3-540-44674-5_13"},{"key":"10.1016\/S0304-3975(02)00545-5_BIB21","unstructured":"O.H. Ibarra, J. Su, T. Bultan, Z. Dang, R.A. Kemmerer, Counter machines: decidable properties and applications to verification problems, MFCS\u201900, Lecture Notes in Computer Science, Vol. 1893, Springer, Berlin, pp. 426\u2013435."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB22","doi-asserted-by":"crossref","unstructured":"K.L. McMillan, Symbolic model-checking\u2014an approach to the state explosion problem, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, 1992.","DOI":"10.1007\/978-1-4615-3190-6_3"},{"issue":"6\/7","key":"10.1016\/S0304-3975(02)00545-5_BIB23","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/BF01185558","article-title":"Analysis of a class of communicating finite state machines","volume":"29","author":"Peng","year":"1992","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00545-5_BIB24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(86)90110-6","article-title":"Boundedness, empty channel detection, and synchronization for communicating finite automata","volume":"44","author":"Rosier","year":"1986","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005455?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005455?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T19:01:07Z","timestamp":1584471667000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502005455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0304397502005455"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00545-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}