{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:44:50Z","timestamp":1648727090251},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":3850,"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,1]]},"DOI":"10.1016\/s0304-3975(02)00076-2","type":"journal-article","created":{"date-parts":[[2003,2,5]],"date-time":"2003-02-05T01:51:53Z","timestamp":1044409913000},"page":"1713-1735","source":"Crossref","is-referenced-by-count":4,"title":["Verification in loosely synchronous queue-connected discrete timed automata"],"prefix":"10.1016","volume":"290","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"}]},{"given":"Pierluigi San","family":"Pietro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00076-2_BIB1","unstructured":"R. Alur, Timed automata. CAV\u201999, Lecture Notes in Computer Science, Vol. 1633, Springer, Berlin, pp. 8\u201322."},{"issue":"2","key":"10.1016\/S0304-3975(02)00076-2_BIB2","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":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(02)00076-2_BIB3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/174644.174651","article-title":"A really temporal logic","volume":"41","author":"Alur","year":"1994","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"10.1016\/S0304-3975(02)00076-2_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/inco.1993.1024","article-title":"Model-checking in dense real time","volume":"104","author":"Alur","year":"1993","journal-title":"Informat. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(02)00076-2_BIB5","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."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB6","unstructured":"D. Beauquier, A. Slissenko, The railroad crossing problem: towards semantics of timed algorithms and their model-checking in high-level languages, Lecture Notes in Computer Science, Vol. 1214, Springer, Berlin, 1997, pp. 202\u2013212."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB7","first-page":"361","article-title":"Finite state descriptions of communicating protocols","volume":"2","author":"von Bochman","year":"1978","journal-title":"Comput. Networks"},{"key":"10.1016\/S0304-3975(02)00076-2_BIB8","unstructured":"A. Bouajjani, J. Esparza, O. Maler, Reachability analysis of pushdown automata: application to model\u2014Checking, CONCUR\u201997, Lecture Notes in Computer Science, Vol. 1243, Springer, Berlin, pp. 135\u2013150."},{"issue":"2","key":"10.1016\/S0304-3975(02)00076-2_BIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On communicating finite-state machines","volume":"30","author":"Brand","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"10.1016\/S0304-3975(02)00076-2_BIB10","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1145\/325478.325480","article-title":"Model-checking concurrent systems with unbounded integer variables","volume":"21","author":"Bultan","year":"1999","journal-title":"TOPLAS"},{"key":"10.1016\/S0304-3975(02)00076-2_BIB11","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."},{"issue":"4","key":"10.1016\/S0304-3975(02)00076-2_BIB12","first-page":"626","article-title":"Formal methods","volume":"28","author":"Clarke","year":"1996","journal-title":"Assoc. Comput. Mach. Comput. Surveys"},{"key":"10.1016\/S0304-3975(02)00076-2_BIB13","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)00076-2_BIB14","unstructured":"H. Comon, Y. Jurski, Timed automata and the theory of real numbers, CONCUR\u201999, Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, pp. 242\u2013257."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB15","unstructured":"Z. Dang, Binary reachability analysis of pushdown timed automata with dense clocks, CAV\u201901, Lecture Notes in Computer Science, Vol. 2102, Springer, Berlin, pp. 506\u2013517."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB16","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)00076-2_BIB17","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)00076-2_BIB18","unstructured":"A. Finkel, B. Willems, P. Wolper, A direct symbolic approach to model checking pushdown systems, Proceedings of the INFINITY\u201997."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB19","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)00076-2_BIB20","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","article-title":"The complexity of decision problems for finite-turn multicounter machines","volume":"22","author":"Gurari","year":"1981","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0304-3975(02)00076-2_BIB21","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":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB22","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. Mach."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB23","doi-asserted-by":"crossref","unstructured":"O.H. Ibarra, Reachability and safety in queue systems with counters and pushdown stack, Proceedings of the International Conference on Implementation and Application of Automata, 2000.","DOI":"10.1007\/3-540-44674-5_12"},{"key":"10.1016\/S0304-3975(02)00076-2_BIB24","doi-asserted-by":"crossref","unstructured":"O.H. Ibarra, Z. Dang, On removing the pushdown stack in reachability constructions. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), 2001.","DOI":"10.1007\/3-540-45678-3_22"},{"issue":"1","key":"10.1016\/S0304-3975(02)00076-2_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1999.1624","article-title":"A technique for the containment and equivalence of linear constraint queries","volume":"59","author":"Ibarra","year":"1999","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB26","doi-asserted-by":"crossref","unstructured":"O.H. Ibarra, J. Su, Generalizing the discrete timed automaton, Proceedings of the International Conference on Implementation and Application of Automata, 2000.","DOI":"10.1007\/3-540-44674-5_13"},{"key":"10.1016\/S0304-3975(02)00076-2_BIB27","series-title":"Words, Sequences, Languages","first-page":"127","article-title":"Counter machines and the safety and disjointness problems for database queries with linear constraints","author":"Ibarra","year":"2000"},{"key":"10.1016\/S0304-3975(02)00076-2_BIB28","unstructured":"R. Mayr, Decidability and complexity of model-checking problems for infinite state systems, Ph.D. Thesis, Inst. f\u00fcr Informatik, Techn. Universit\u00e4t M\u00fcnchen, 1998."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB29","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)00076-2_BIB30","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 Informat."},{"key":"10.1016\/S0304-3975(02)00076-2_BIB31","unstructured":"S. Yovine, Model-checking timed automata, Embedded Systems, Lecture Notes in Computer Science, Vol. 1494, Springer, Berlin, 1998, pp. 114\u2013152."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000762?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000762?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T10:41:33Z","timestamp":1579084893000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502000762"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00076-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}