{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:34:01Z","timestamp":1773653641663,"version":"3.50.1"},"reference-count":22,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"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. Conrol Comp. Sci."],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.3103\/s0146411611070091","type":"journal-article","created":{"date-parts":[[2012,1,5]],"date-time":"2012-01-05T17:57:59Z","timestamp":1325786279000},"page":"444-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the reachability set of automaton counter machines"],"prefix":"10.3103","volume":"45","author":[{"given":"E. V.","family":"Kuzmin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. J.","family":"Chalyy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2012,1,6]]},"reference":[{"key":"6172_CR1","first-page":"368","volume":"2102","author":"A. Annichini","year":"2001","unstructured":"Annichini, A., Bouajjani, A., and Sighireanu, M., TReX: A Tool for Reachability Analysis of Complex Systems, Lect. Notes Compt. Sci., 2001, vol. 2102, pp. 368\u2013372.","journal-title":"TReX: A Tool for Reachability Analysis of Complex Systems"},{"issue":"1","key":"6172_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(77)90059-7","volume":"4","author":"T. Araki","year":"1977","unstructured":"Araki, T. and Kasami, T., Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets, Theor. Comp. Sci., 1977, vol. 4, no. 1, pp. 99\u2013119.","journal-title":"Theor. Comp. Sci."},{"key":"6172_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11817963_9","volume":"4144","author":"S. Bardin","year":"2006","unstructured":"Bardin, S., Leroux, J., and Point, G., FAST Extended Release, Lect. Notes Compt. Sci., 2006, vol. 4144, pp. 63\u201366.","journal-title":"Lect. Notes Compt. Sci."},{"issue":"1","key":"6172_CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J. Esparza","year":"1997","unstructured":"Esparza, J., Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes, Fundam. Inform., 1997, vol. 31, no. 1, pp. 13\u201325.","journal-title":"Fundam. Inform."},{"key":"6172_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36206-1_14","volume":"2556","author":"A. Finkel","year":"2002","unstructured":"Finkel, A. and Leroux, J., How to Compose Presburger Accelerations: Applications to Broadcast Protocols, Lect. Notes Compt. Sci., 2002, vol. 2556, pp. 145\u2013156.","journal-title":"Lect. Notes Compt. Sci."},{"key":"6172_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-85238-4_26","volume":"5162","author":"A. Finkel","year":"2008","unstructured":"Finkel, A. and Sangnier, A., Reversal-Bounded Counter Machines Revisited, Lect. Notes Compt. Sci., 2008, vol. 5162, pp. 323\u2013334.","journal-title":"Lect. Notes Compt. Sci."},{"key":"6172_CR7","unstructured":"Hopcroft, J.E. and Pansiot, J., On the Reachability Problem for 5-Dimensional Vector Addition Systems, Computer Science Technical Report, Cornell Univ., 1976. http:\/\/hdl.handle.net\/1813\/6102"},{"issue":"1","key":"6172_CR8","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, J. ACM, 1978, vol. 25, no. 1, pp. 116\u2013133.","journal-title":"J. ACM"},{"key":"6172_CR9","volume-title":"Theorie der Endlichen und Unendlichen Graphen","author":"D. Konig","year":"1936","unstructured":"Konig, D., Theorie der Endlichen und Unendlichen Graphen, Leipzig: Akademische Verlagsgesellschaft, 1936."},{"key":"6172_CR10","unstructured":"Kouzmin, E.V. and Sokolov, V.A., Communicating Coloring Automata, Proc. Int. Workshop on Program Understanding, 2003, pp. 40\u201346."},{"key":"6172_CR11","unstructured":"Kuzmin, E.V., Sokolov, V.A., and Chaly, D.Ju., Automaton Counter Machines, Proc. Int. Workshop on Program Understanding, 2009, pp. 1\u20134."},{"key":"6172_CR12","unstructured":"LASH (The Liuge Automata-based Symbolic Handler). http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash"},{"key":"6172_CR13","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/11562948_35","volume":"3707","author":"J. Leroux","year":"2005","unstructured":"Leroux, J. and Sutre, G., Flat Counter almost Everywhere! Lect. Notes Compt. Sci., 2005, vol. 3707, pp. 474\u2013488.","journal-title":"Lect. Notes Compt. Sci."},{"key":"6172_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF00289268","volume":"15","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W., Persistence of Vector Replacement Systems Is Decidable, Acta Informatica, 1981, vol. 15, pp. 309\u2013318.","journal-title":"Acta Informatica"},{"issue":"3","key":"6172_CR15","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W., An Algorithm for the General Petri Net Reachability Problem, SIAM J. Comput., 1984, vol. 13, no. 3, pp. 441\u2013460.","journal-title":"SIAM J. Comput."},{"key":"6172_CR16","unstructured":"Presburger, M., \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Sprawozdanie Z I Kongresu Matematykow Krajow Slowiariskich, (Proc. First Congress of Mathematicions of Slavonic Countries), Warsaw, 1930, pp. 92\u2013101."},{"issue":"3","key":"6172_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0022-0000(81)90067-2","volume":"23","author":"R. Valk","year":"1981","unstructured":"Valk, R. and Vidal-Naquet, G., Petri Nets and Regular Languages, J. Comput. Syst. Sci., 1981, vol. 23, no. 3, pp. 299\u2013325.","journal-title":"J. Comput. Syst. Sci."},{"key":"6172_CR18","unstructured":"Ginzburg, S., Mathematical Theory of Context-Free Languages, McGraw-Hill, 1966."},{"issue":"2","key":"6172_CR19","first-page":"8","volume":"11","author":"E.V. Kuzmin","year":"2004","unstructured":"Kuzmin, E.V. and Sokolov, V.A., Communicating Coloring Processes, Modelir. Analiz Inform. Sistem, 2004, vol. 11, no. 2, pp. 8\u201317.","journal-title":"Modelir. Analiz Inform. Sistem"},{"issue":"2","key":"6172_CR20","first-page":"75","volume":"16","author":"E.V. Kuzmin","year":"2009","unstructured":"Kuzmin, E.V. and Chalyy, D.Ju., On a Class of Counter Machines, Modelir. Analiz Inform. Sistem, 2009, vol. 16, no. 2, pp. 75\u201382.","journal-title":"Modelir. Analiz Inform. Sistem"},{"issue":"3","key":"6172_CR21","first-page":"77","volume":"16","author":"E.V. Kuzmin","year":"2009","unstructured":"Kuzmin, E.V. and Chalyy, D.Ju., On a Reachability Set of Automaton 3-Counter Machines, Modelir. Analiz Inform. Sistem, 2009, vol. 16, no. 3, pp. 77\u201384.","journal-title":"Modelir. Analiz Inform. Sistem"},{"key":"6172_CR22","unstructured":"Minsky, M., Computation: Finite and Infinite Machines, Prentice-Hall, 1967."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411611070091.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411611070091","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411611070091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411611070091.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:00:27Z","timestamp":1773612027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411611070091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":22,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["6172"],"URL":"https:\/\/doi.org\/10.3103\/s0146411611070091","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]},"assertion":[{"value":"15 December 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2012","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}