{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T15:04:45Z","timestamp":1791299085882,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642040801","type":"print"},{"value":"9783642040818","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04081-8_25","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T12:27:08Z","timestamp":1251721628000},"page":"369-383","source":"Crossref","is-referenced-by-count":51,"title":["Reachability in Succinct and Parametric One-Counter Automata"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Haase","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephan","family":"Kreutzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0055627","volume-title":"CONCUR \u201998 Concurrency Theory","author":"P.A. Abdulla","year":"1998","unstructured":"Abdulla, P.A., Cerans, K.: Simulation is decidable for one-counter nets. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 253\u2013268. Springer, Heidelberg (1998)"},{"key":"25_CR2","first-page":"592","volume-title":"Proc. STOC 1993","author":"R. Alur","year":"1993","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Proc. STOC 1993, pp. 592\u2013601. ACM, New York (1993)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/11817963_47","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2006","unstructured":"Bouajjani, A., Bozga, M., Habermehl, P., Iosif, R., Moro, P., Vojnar, T.: Programs with lists are counter automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 517\u2013531. Springer, Heidelberg (2006)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/11787006_49","volume-title":"Automata, Languages and Programming","author":"M. Bozga","year":"2006","unstructured":"Bozga, M., Iosif, R., Lakhnech, Y.: Flat parametric counter automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 577\u2013588. Springer, Heidelberg (2006)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (1998)"},{"key":"25_CR6","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to algorithms. MIT Press and McGraw-Hill (1990)"},{"key":"25_CR7","unstructured":"Demri, S.: Logiques pour la sp\u00e9cification et v\u00e9rification. M\u00e9moire d\u2019habilitation, Universit\u00e9 Paris\u00a07 (2007)"},{"key":"25_CR8","volume-title":"Proc. TIME 2007","author":"S. Demri","year":"2007","unstructured":"Demri, S., Gascon, R.: The effects of bounding syntactic resources on Presburger LTL. In: Proc. TIME 2007. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"25_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"2-3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.tcs.2003.10.027","volume":"312","author":"O.H. Ibarra","year":"2004","unstructured":"Ibarra, O.H., Dang, Z.: On two-way finite automata with monotonic counters and quadratic diophantine equations. Theor. Comput. Sci.\u00a0312(2-3), 359\u2013378 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.tcs.2005.12.001","volume":"352","author":"O.H. Ibarra","year":"2006","unstructured":"Ibarra, O.H., Dang, Z.: On the solvability of a class of diophantine equations and applications. Theor. Comput. Sci.\u00a0352(1), 342\u2013346 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-56939-1_82","volume-title":"ICALP","author":"O.H. Ibarra","year":"1993","unstructured":"Ibarra, O.H., Jiang, T., Tr\u00e2n, N., Wang, H.: New decidability results concerning two-way counter machines and applications. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 313\u2013324. Springer, Heidelberg (1993)"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(03)00171-8","volume":"188","author":"P. Jan\u010dar","year":"2004","unstructured":"Jan\u010dar, P., Ku\u010dera, A., Moller, F., Sawa, Z.: DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information Computation\u00a0188(1), 1\u201319 (2004)","journal-title":"Information Computation"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-45022-X_28","volume-title":"Automata, Languages and Programming","author":"A. Ku\u010dera","year":"2000","unstructured":"Ku\u010dera, A.: Efficient verification algorithms for one-counter processes. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, p. 317. Springer, Heidelberg (2000)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Lafourcade, P., Lugiez, D., Treinen, R.: Intruder deduction for AC-like equational theories with homomorphisms. In: Research Report LSV-04-16. LSV, ENS de Cachan (2004)","DOI":"10.1007\/978-3-540-32033-3_23"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11562948_36","volume-title":"Automated Technology for Verification and Analysis","author":"J. Leroux","year":"2005","unstructured":"Leroux, J., Sutre, G.: Flat counter automata almost everywhere! In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 489\u2013503. Springer, Heidelberg (2005)"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1090\/S0002-9947-1978-0469886-1","volume":"235","author":"L. Lipshitz","year":"1976","unstructured":"Lipshitz, L.: The diophantine problem for addition and divisibility. Transaction of the American Mathematical Society\u00a0235, 271\u2013283 (1976)","journal-title":"Transaction of the American Mathematical Society"},{"key":"25_CR18","first-page":"238","volume-title":"Proc. STOC 1981","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W.: An algorithm for the general petri net reachability problem. In: Proc. STOC 1981, pp. 238\u2013246. ACM, New York (1981)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Minsky, M.: Recursive unsolvability of post\u2019s problem of \u201dtag\u201d and other topics in theory of turing machines. Annals of Math.\u00a074(3) (1961)","DOI":"10.2307\/1970290"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/3-540-45061-0_53","volume-title":"Automata, Languages and Programming","author":"G. Xie","year":"2003","unstructured":"Xie, G., Dang, Z., Ibarra, O.H.: A solvable class of quadratic diophantine equations with applications to verification of infinite-state systems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 668\u2013680. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T04:47:15Z","timestamp":1558500435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}