{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:29Z","timestamp":1725549509154},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_17","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"198-210","source":"Crossref","is-referenced-by-count":1,"title":["Real-Counter Automata and Their Decision Problems"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Dang","sequence":"first","affiliation":[]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[]},{"given":"Pierluigi San","family":"Pietro","sequence":"additional","affiliation":[]},{"given":"Gaoyan","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-57318-6_30","volume-title":"Hybrid Systems","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol.\u00a0736, pp. 209\u2013229. Springer, Heidelberg (1993)"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","volume-title":"Proceedings of FOCS 1992","author":"R. Alur","year":"1992","unstructured":"Alur, R., Henzinger, T.A.: Back to the future: Towards a theory of timed regular languages. In: Proceedings of FOCS 1992. IEEE press, Los Alamitos (1992)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM\u00a049(2), 172\u2013206","DOI":"10.1145\/506147.506151"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/3-540-58179-0_43","volume-title":"Computer Aided Verification","author":"B. Boigelot","year":"1994","unstructured":"Boigelot, B., Wolper, P.: Symbolic verification with periodic sets. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 55\u201367. Springer, Heidelberg (1994)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-44685-0_17","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Bouyer","year":"2001","unstructured":"Bouyer, P., Petit, A., Therien, D.: An algebraic characterization of data and timed languages. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 248\u2013261. Springer, Heidelberg (2001)"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems\u00a08(2), 244\u2013263 (1986)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"Computer Aided Verification","author":"H. Comon","year":"1998","unstructured":"Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and Presburger arithmetic. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 268\u2013279. Springer, Heidelberg (1998)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(02)00743-0","volume":"302","author":"Z. Dang","year":"2003","unstructured":"Dang, Z.: Pushdown time automata: a binary reachability characterization and safety verification. Theoretical Computer Science\u00a0302, 93\u2013121 (2003)","journal-title":"Theoretical Computer Science"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/10722167_9","volume-title":"Proceedings of the International Conference on Computer Aided Verification CAV 2000","author":"Z. Dang","year":"2000","unstructured":"Dang, Z., Ibarra, O.H., Bultan, T., Kemmerer, R.A., Su, J.: Binary reachability analysis of discrete pushdown timed automata. In: CAV 2000. LNCS, vol.\u00a01855, pp. 69\u201384. Springer, Heidelberg (2000)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(02)00432-2","volume":"296","author":"Z. Dang","year":"2003","unstructured":"Dang, Z., Ibarra, O.H., Kemmerer, R.A.: Generalized discrete timed automata: decidable approximations for safety verification. Theoretical Computer Science\u00a0296, 59\u201374 (2003)","journal-title":"Theoretical Computer Science"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-45294-X_12","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"Z. Dang","year":"2001","unstructured":"Dang, Z., Ibarra, O.H., San Pietro, P.: Liveness Verification of Reversal-bounded Multicounter Machines with a Free Counter. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 132\u2013143. Springer, Heidelberg (2001)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-36136-7_10","volume-title":"Algorithms and Computation","author":"Z. Dang","year":"2002","unstructured":"Dang, Z., Ibarra, O.H., Sun, Z.: On the emptiness problem for two-way NFA with one reversal-bounded counter. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 103\u2013114. Springer, Heidelberg (2002)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0304-3975(02)00485-1","volume":"299","author":"Z. Dang","year":"2003","unstructured":"Dang, Z., San Pietro, P., Kemmerer, R.A.: Presburger liveness verification for discrete timed automata. Theoretical Computer Science\u00a0299, 413\u2013438 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3\/4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1009747629591","volume":"2","author":"L. Fribourg","year":"1997","unstructured":"Fribourg, L., Olsen, H.: A decompositional approach for computing least fixed-points of Datalog programs with Z-counters. Constraints\u00a02(3\/4), 305\u2013335 (1997)","journal-title":"Constraints"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/3-540-63166-6_48","volume-title":"Computer Aided Verification","author":"T.A. Henzinger","year":"1997","unstructured":"Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HyTech: A Model Checker for Hybrid Systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 460\u2013463. Springer, Heidelberg (1997)"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM\u00a025(1), 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1137\/S0097539792240625","volume":"24","author":"O.H. Ibarra","year":"1995","unstructured":"Ibarra, O.H., Jiang, T., Tran, N., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Comput.\u00a024, 123\u2013137 (1995)","journal-title":"SIAM J. Comput."},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","first-page":"179","volume-title":"Workshop on Theory of Hybrid Systems","author":"Y. Keste","year":"1992","unstructured":"Keste, Y., Pnueli, A., Sifakis, J., Yovine, S.: Integration graphs: A class of decidable hybrid systems. In: Workshop on Theory of Hybrid Systems. LNCS, vol.\u00a0736, pp. 179\u2013208. Springer, Heidelberg (1992)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"Minsky, M.: Recursive unsolvability of Post\u2019s problem of Tag and other topics in the theory of Turing machines. Ann. of Math.\u00a074, 437\u2013455 (1961)","journal-title":"Ann. of Math."},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","first-page":"149","volume-title":"Hybrid Systems","author":"X. Nicollin","year":"1992","unstructured":"Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: An approach to the description and analysis of hybrid systems. In: Hybrid Systems. LNCS, vol.\u00a0736, pp. 149\u2013178. Springer, Heidelberg (1992)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Puri, A., Kopke, P., Henzinger, T., Varaiya, P.: What\u2019s decidable about hybrid automata? In: 27th Annual ACM Symposium on Theory of Computing STOC 1995, pp. 372\u2013382 (1995)","DOI":"10.1145\/225058.225162"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. Journal of the ACM\u00a013, 570\u2013581 (1966)","journal-title":"Journal of the ACM"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45071-8_18","volume-title":"Computing and Combinatorics","author":"P. San Pietro","year":"2003","unstructured":"San Pietro, P., Dang, Z.: Automatic verification of multi-queue discrete timed automata. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 159\u2013171. Springer, Heidelberg (2003)"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-53507-1_77","volume-title":"ICDT \u201990","author":"P.Z. Revesz","year":"1990","unstructured":"Revesz, P.Z.: A closed form for datalog queries with integer order. In: Kanellakis, P.C., Abiteboul, S. (eds.) ICDT 1990. LNCS, vol.\u00a0470, pp. 187\u2013201. Springer, Heidelberg (1990)"},{"key":"17_CR26","first-page":"332","volume-title":"Proceedings 1st Annual IEEESymp.on Logic in Computer Science, LICS 1986","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings 1st Annual IEEESymp.on Logic in Computer Science, LICS 1986, Cambridge,MA,USA, June 16\u201318, pp. 332\u2013344. IEEE Computer Society Press, Washington, DC (1986)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: Proc. Intl. Symp. on Symbolic and Algebraic Computation, Vancouver, B.C., Canada, July 29-31, pp. 129\u2013136 (1999)","DOI":"10.1145\/309831.309888"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-45069-6_8","volume-title":"Computer Aided Verification","author":"G. Xie","year":"2003","unstructured":"Xie, G., Dang, Z., Ibarra, O.H., San Pietro, P.: Dense counter machines and verification problems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 163\u2013175. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:49:37Z","timestamp":1685490577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}