{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:40:44Z","timestamp":1725543644270},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359074"},{"type":"electronic","value":"9783540359081"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11787006_49","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T19:23:09Z","timestamp":1151522589000},"page":"577-588","source":"Crossref","is-referenced-by-count":20,"title":["Flat Parametric Counter Automata"],"prefix":"10.1007","author":[{"given":"Marius","family":"Bozga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Iosif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yassine","family":"Lakhnech","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44585-4_34","volume-title":"Computer Aided Verification","author":"A. Annichini","year":"2001","unstructured":"Annichini, A., Bouajjani, A., Sighireanu, M.: Trex: A tool for reachability analysis of complex systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 368\u2013372. Springer, Heidelberg (2001)"},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"A. Finkel","year":"2003","unstructured":"Finkel, A., Leroux, J., Petrucci, L., Bardin, S.: FAST: Fast Acceleration of Symbolic Transition Systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, Springer, Heidelberg (2003)"},{"issue":"2","key":"49_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0304-3975(03)00314-1","volume":"309","author":"B. Boigelot","year":"2003","unstructured":"Boigelot, B.: On iterating linear transformations over recognizable sets of integers. TCS\u00a0309(2), 413\u2013468 (2003)","journal-title":"TCS"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44622-2_17","volume-title":"Computer Science Logic","author":"H. Comon","year":"2000","unstructured":"Comon, H., Cortier, V.: Flatness Is Not a Weakness. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 262\u2013276. Springer, Heidelberg (2000)"},{"key":"49_CR5","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":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36206-1_14","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"A. Finkel","year":"2002","unstructured":"Finkel, A., Leroux, J.: How to compose presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 145\u2013156. Springer, Heidelberg (2002)"},{"issue":"2","key":"49_CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, presburger formulas and languages. Pacific Journal of Mathematics\u00a016(2), 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01700692","volume":"38","author":"K. G\u00f6del","year":"1931","unstructured":"G\u00f6del, K.: \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I. Monatshefte f\u00fcr Mathematik und Physik\u00a038, 173 (1931)","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"key":"49_CR9","unstructured":"Hilbert, D.: Mathematische probleme. Vortrag, gehalten auf dem internationalen Mathematiker-Kongress zu Paris. In: Nachrichten von der K\u00f6nigliche Gesellschaft der Wissenschaften zu G\u00f6ttingen, pp. 253\u2013297 (1900)"},{"issue":"1","key":"49_CR10","doi-asserted-by":"crossref","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 Association for Computing Machinery\u00a025(1), 116\u2013133 (1978)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"49_CR11","unstructured":"Ibarra, O.H., Dang, Z.: On the solvability of a class of diophantine equations and applications (submitted, 2005)"},{"key":"49_CR12","first-page":"354","volume":"11","author":"Y. Matiyasevich","year":"1970","unstructured":"Matiyasevich, Y.: Enumerable sets are diophantine. Journal of Sovietic Mathematics\u00a011, 354\u2013358 (1970)","journal-title":"Journal of Sovietic Mathematics"},{"key":"49_CR13","unstructured":"Matiyasevich, Y.: Personal communication (2005)"},{"key":"49_CR14","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"49_CR15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1090\/conm\/270\/04369","volume":"270","author":"T. Pheidas","year":"2000","unstructured":"Pheidas, T., Zahidi, K.: Undecidability of existential theories of rings and fields: A survey. Contemporary Mathematics\u00a0270, 49\u2013106 (2000)","journal-title":"Contemporary Mathematics"},{"key":"49_CR16","unstructured":"Pottier, L.: Solutions minimales des systemes diophantiens lineaires: bornes et algorithmes. Technical Report 1292, INRIA Sophia Antipolis (1990)"},{"key":"49_CR17","unstructured":"Presburger, M.: Uber die Vollstandigkeit eines gewissen Systems der Arithmetik. In: Comptes rendus du I Congr\u00e9s des Pays Slaves, Warsaw (1929)"},{"key":"49_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BFb0028736","volume-title":"Computer Aided Verification","author":"P. Wolper","year":"1998","unstructured":"Wolper, P., Boigelot, B.: Verifying systems with infinite but regular state spaces. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 88\u201397. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11787006_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:20:20Z","timestamp":1619493620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11787006_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359074","9783540359081"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11787006_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}