{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:45:27Z","timestamp":1725558327986},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405245"},{"type":"electronic","value":"9783540450696"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45069-6_8","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:11:46Z","timestamp":1277226706000},"page":"93-105","source":"Crossref","is-referenced-by-count":4,"title":["Dense Counter Machines and Verification Problems"],"prefix":"10.1007","author":[{"given":"Gaoyan","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierluigi San","family":"Pietro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1008626013578","volume":"11","author":"R. Alur","year":"1997","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A.: Computing accumulated delays in realtime systems. Formal Methods in System Design: An International Journal\u00a011(2), 137\u2013155 (1997)","journal-title":"Formal Methods in System Design: An International Journal"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Hybrid Systems, pp. 209\u2013229 (1992)","DOI":"10.1007\/3-540-57318-6_30"},{"issue":"2","key":"8_CR3","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":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0055049","volume-title":"Automata, Languages and Programming","author":"B. Boigelot","year":"1998","unstructured":"Boigelot, B., Rassart, S., Wolper, P.: On the expressiveness of real and integer arithmetic automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 152\u2013163. Springer, Heidelberg (1998)"},{"key":"8_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":"8_CR6","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":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-48320-9_18","volume-title":"CONCUR\u201999. Concurrency Theory","author":"H. Comon","year":"1999","unstructured":"Comon, H., Jurski, Y.: Timed automata and the theory of real numbers. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 242\u2013257. Springer, Heidelberg (1999)"},{"key":"8_CR8","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 problems for two-way nondeterministic finite automata with one reversal-bounded counter. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 103\u2013114. Springer, Heidelberg (2002)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/10722167_9","volume-title":"Computer Aided Verification","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: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 69\u201384. Springer, Heidelberg (2000)"},{"issue":"6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1142\/S0129054102001539","volume":"13","author":"Z. Dang","year":"2002","unstructured":"Dang, Z., Ibarra, O.H.: On the existence of \u03c9-chains for transitive mixed linear relations and its applications. International Journal of Foundations of Computer Science\u00a013(6), 911\u2013936 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-44693-1_12","volume-title":"STACS 2001","author":"Z. Dang","year":"2001","unstructured":"Dang, Z., San Pietro, P., Kemmerer, R.A.: On Presburger Liveness of Discrete Timed Automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 132\u2013143. Springer, Heidelberg (2001)"},{"issue":"3\/4","key":"8_CR12","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":"8_CR13","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 ModelChecker for Hybrid Systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 460\u2013463. Springer, Heidelberg (1997)"},{"issue":"1","key":"8_CR14","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":"8_CR15","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":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-44585-4_47","volume-title":"Computer Aided Verification","author":"K. Larsen","year":"2001","unstructured":"Larsen, K., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 493\u2013505. Springer, Heidelberg (2001)"},{"key":"8_CR17","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":"8_CR18","doi-asserted-by":"crossref","unstructured":"Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: An approach to the description and analysis of hybrid systems. In: Hybrid Systems, pp. 149\u2013178 (1992)","DOI":"10.1007\/3-540-57318-6_28"},{"key":"8_CR19","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), pp. 372\u2013382 (1995)","DOI":"10.1145\/225058.225162"},{"key":"8_CR20","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":"8_CR21","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"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45069-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T14:18:08Z","timestamp":1685629088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45069-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405245","9783540450696"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45069-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}