{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T22:58:30Z","timestamp":1790636310936,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141614","type":"print"},{"value":"9783642141621","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_48","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T05:26:21Z","timestamp":1278307581000},"page":"575-586","source":"Crossref","is-referenced-by-count":20,"title":["Model Checking Succinct and Parametric One-Counter Automata"],"prefix":"10.1007","author":[{"given":"Stefan","family":"G\u00f6ller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Haase","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":"48_CR1","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(01)80001-X","volume-title":"Rudiments of \u03bc-calculus","author":"A. Arnold","year":"2001","unstructured":"Arnold, A., Niwi\u0144ski, D.: Rudiments of \u03bc-calculus. Studies in Logic and the Foundations of Mathematics, vol.\u00a0146. North-Holland, Amsterdam (2001)"},{"key":"48_CR2","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":"48_CR3","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":"48_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-3-540-31982-5_27","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Bozga","year":"2005","unstructured":"Bozga, M., Iosif, R.: On decidability within the arithmetic of addition and divisibility. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 425\u2013439. Springer, Heidelberg (2005)"},{"issue":"1","key":"48_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1142\/S0129054191000054","volume":"2","author":"J.-Y. Cai","year":"1991","unstructured":"Cai, J.-Y., Furst, M.: PSPACE survives constant-width bottlenecks. International Journal of Foundations of Computer Science\u00a02(1), 67\u201376 (1991)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1017074.1017096","volume-title":"Proc. of WebDB","author":"C. Chitic","year":"2004","unstructured":"Chitic, C., Rosu, D.: On validation of xml streams using finite state machines. In: Proc. of WebDB, pp. 85\u201390. ACM, New York (2004)"},{"issue":"3","key":"48_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1051\/ita:2001119","volume":"35","author":"A. Chiu","year":"2001","unstructured":"Chiu, A., Davida, G., Litow, B.: Division in logspace-uniform $\\rm NC\\sp 1$ . Theoretical Informatics and Applications. Informatique Th\u00e9orique et Applications\u00a035(3), 259\u2013275 (2001)","journal-title":"Theoretical Informatics and Applications. Informatique Th\u00e9orique et Applications"},{"key":"48_CR8","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)"},{"issue":"6","key":"48_CR9","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1093\/logcom\/exp037","volume":"19","author":"S. Demri","year":"2009","unstructured":"Demri, S., Gascon, R.: The effects of bounding syntactic resources on Presburger LTL. Journal of Logic and Computation\u00a019(6), 1541\u20131575 (2009)","journal-title":"Journal of Logic and Computation"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"G\u00f6ller, S., Haase, C., Ouaknine, J., Worrel, J.: Model checking succinct and parametric one-counter automata. Technical report, University of Bremen (2010), http:\/\/www.informatik.uni-bremen.de\/tdki\/research\/papers\/succ.pdf","DOI":"10.1007\/978-3-642-14162-1_48"},{"key":"48_CR11","unstructured":"G\u00f6ller, S., Lohrey, M.: Branchning-time model checking of one-counter processes. Technical report, arXiv.org (2009), http:\/\/arxiv.org\/abs\/0909.1102"},{"key":"48_CR12","unstructured":"G\u00f6ller, S., Lohrey, M.: Branchning-time model checking of one-counter processes. In: Proc. of STACS, IFIB Schloss Dagstuhl (2010)"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Haase, C., Kreutzer, S., Ouaknine, J., Worrell, J.: Reachability in parametric one-counter automata (2010) (submitted), http:\/\/www.comlab.ox.ac.uk\/files\/2833\/iandc.pdf","DOI":"10.1007\/978-3-642-04081-8_25"},{"key":"48_CR14","first-page":"200","volume-title":"Proc. of CoCo","author":"U. Hertrampf","year":"1993","unstructured":"Hertrampf, U., Lautemann, C., Schwentick, T., Vollmer, H., Wagner, K.W.: On the power of polynomial time bit-reductions. In: Proc. of CoCo, pp. 200\u2013207. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"48_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-56939-1_82","volume-title":"Automata, Languages and Programming","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":"48_CR16","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."},{"issue":"1","key":"48_CR17","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":"48_CR18","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":"48_CR19","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M.L. Minsky","year":"1961","unstructured":"Minsky, M.L.: Recursive unsolvability of Post\u2019s problem of \u201ctag\u201d and other topics in theory of Turing machines. Annals of Mathematics. Second Series\u00a074, 437\u2013455 (1961)","journal-title":"Annals of Mathematics. Second Series"},{"key":"48_CR20","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"48_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11690634_23","volume-title":"Foundations of Software Science and Computation Structures","author":"O. Serre","year":"2006","unstructured":"Serre, O.: Parity games played on transition graphs of one-counter processes. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 337\u2013351. Springer, Heidelberg (2006)"},{"key":"48_CR22","unstructured":"Vollmer, H.: A generalized quantifier concept in computational complexity theory. Technical report, arXiv.org (1998), http:\/\/arxiv.org\/abs\/cs.CC\/9809115"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T15:09:09Z","timestamp":1635606549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}