{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:53:30Z","timestamp":1773615210658,"version":"3.50.1"},"reference-count":13,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.3103\/s0146411614070189","type":"journal-article","created":{"date-parts":[[2015,1,30]],"date-time":"2015-01-30T19:16:45Z","timestamp":1422645405000},"page":"564-574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the efficient modeling of unbounded resource by one-counter circuits"],"prefix":"10.3103","volume":"48","author":[{"given":"V. A.","family":"Bashkin","sequence":"first","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2015,2,1]]},"reference":[{"key":"6358_CR1","series-title":"Lecture Notes Compt. Sci.","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0055627","volume-title":"CONCUR\u201998 Concurrency Theory","author":"PA Abdulla","year":"1998","unstructured":"Abdulla, P.A. and \u010cerans, K., Simulation is decidable for one-counter nets, in: CONCUR\u201998 Concurrency Theory, Sangiorgi, D. and Simone, R., Eds., Lecture Notes Compt. Sci., 1998, vol. 1466, pp. 253\u2013268."},{"key":"6358_CR2","first-page":"60","volume-title":"Concurrency, Specification, and Programming (CS&P 2009)","author":"VA Bashkin","year":"2009","unstructured":"Bashkin, V.A., On the single-periodic representation of reachability in one-counter nets, in Concurrency, Specification, and Programming (CS&P 2009), Czaja, L. and Szczuka, M., Eds., Warsaw: Warsaw Univ., 2009, pp. 60\u201371."},{"key":"6358_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2307\/2371684","volume":"64","author":"A Brauer","year":"1942","unstructured":"Brauer, A., On a problem of partitions, Am. J. Mathem., 1942, vol. 64, pp. 299\u2013312.","journal-title":"Am. J. Mathem."},{"key":"6358_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4064\/aa-21-1-399-408","volume":"21","author":"P Erd\u00f6s","year":"1972","unstructured":"Erd\u00f6s, P. and Graham, R.L., On a linear diophantine problem of Frobenius, Acta Arithmetica, 1972, vol. 21, pp. 399\u2013408.","journal-title":"Acta Arithmetica"},{"key":"6358_CR5","series-title":"Lecture Notes Compt. Sci.","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-642-14162-1_48","volume-title":"Automata, Languages, and Programming","author":"S G\u00f6ller","year":"2010","unstructured":"G\u00f6ller, S., Haase, C., Ouaknine, J., and Worrell, J., Model checking succinct and parametric one-counter automata, in: Automata, Languages, and Programming, Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., and Spirakis, P., Eds., Lecture Notes Compt. Sci., 2010, vol. 6199, pp. 575\u2013586."},{"key":"6358_CR6","volume-title":"Proc. 2009 24th Annual IEEE Symp. on Logic in Computer Science, LICS\u201909","author":"S G\u00f6ller","year":"2009","unstructured":"G\u00f6ller, S., Mayr, R., and To, A.W., On the computational complexity of verifying one-counter processes, Proc. 2009 24th Annual IEEE Symp. on Logic in Computer Science, LICS\u201909, IEEE Computer Society, Washington, 2009."},{"key":"6358_CR7","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., and Sawa, Z., DP lower bounds for equivalence-checking and model-checking of one-counter automata, Information and Computation, 2004, vol. 188, pp. 1\u201319.","journal-title":"Information and Computation"},{"key":"6358_CR8","series-title":"Lecture Notes Compt. Sci.","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 Automata, Languages, and Programming, Montanari, U., Rolim, J.D., and Welzl, E., Eds., Lecture Notes Compt. Sci., 2000, vol. 1853, pp. 317\u2013328."},{"key":"6358_CR9","doi-asserted-by":"publisher","first-page":"444","DOI":"10.3103\/S0146411611070091","volume":"45","author":"EV Kuzmin","year":"2011","unstructured":"Kuzmin, E.V. and Chalyy, D.Ju., On the reachability set of automaton counter machines, Autom. Control Compt. Sci., 2011, vol. 45, pp. 444\u2013451.","journal-title":"Autom. Control Compt. Sci."},{"key":"6358_CR10","first-page":"337","volume-title":"Sibir. Matem. J.","author":"UI Liubicz","year":"1964","unstructured":"Liubicz, U.I., Bounds for the optimal determinization of nondeterministic autonomic automata, Sibir. Matem. J., 1964, no. 2, pp. 337\u2013355."},{"key":"6358_CR11","series-title":"Lecture Notes Compt. Sci.","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 Foundations of Software Science and Computation Structures, Aceto, L. and Ing\u00f6lfsd\u00f6ttir, A., Eds., Lecture Notes Compt. Sci., 2006, vol. 3921, pp. 337\u2013351."},{"key":"6358_CR12","first-page":"21","volume":"41","author":"J J Sylvester","year":"1884","unstructured":"Sylvester, J. J., Question 7382, Mathematical questions with their solutions, Educ. Times, 1884, vol. 41, p. 21.","journal-title":"Educ. Times"},{"key":"6358_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R., Depth-first search and linear graph algorithms, SIAM J. Compt., 1972, vol. 1, pp. 146\u2013160.","journal-title":"SIAM J. Compt."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411614070189.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411614070189","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411614070189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411614070189.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T21:56:53Z","timestamp":1773611813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411614070189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":13,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["6358"],"URL":"https:\/\/doi.org\/10.3103\/s0146411614070189","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]},"assertion":[{"value":"20 March 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}