{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:53:03Z","timestamp":1773654783895,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540852377","type":"print"},{"value":"9783540852384","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_26","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T15:34:36Z","timestamp":1219073676000},"page":"323-334","source":"Crossref","is-referenced-by-count":14,"title":["Reversal-Bounded Counter Machines Revisited"],"prefix":"10.1007","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Sangnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"1","key":"26_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., Kasami, T.: Decidable problems on the strong connectivity of Petri net reachability sets. Theor. Comput. Sci.\u00a04(1), 99\u2013119 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11817963_9","volume-title":"Computer Aided Verification","author":"S. Bardin","year":"2006","unstructured":"Bardin, S., Leroux, J., Point, G.: FAST extended release. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 63\u201366. Springer, Heidelberg (2006)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","first-page":"132","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"O.H. Ibarra","year":"2001","unstructured":"Ibarra, O.H., Dang, Z., San Pietro, P.: Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 132\u2013143. Springer, Heidelberg (2001)"},{"issue":"1","key":"26_CR5","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.\u00a031(1), 13\u201325 (1997)","journal-title":"Fundam. Inform."},{"key":"26_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)"},{"key":"26_CR7","unstructured":"Finkel, A., Sangnier, A.: Reversal-bounded counter machines revisited. Research report, Laboratoire Specification et Verification, ENS Cachan (2008)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc (3)\u00a02, 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc. (3)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci.\u00a08, 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"26_CR10","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\u00a025(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0304-3975(01)00268-7","volume":"289","author":"O.H. Ibarra","year":"2002","unstructured":"Ibarra, O.H., Su, J., Dang, Z., Bultan, T., Kemmerer, R.A.: Counter machines and verification problems. Theor. Comput. Sci.\u00a0289(1), 165\u2013189 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","first-page":"413","volume-title":"Advances in Petri Nets","author":"M. Jantzen","year":"1987","unstructured":"Jantzen, M.: Complexity of place\/transition nets. In: APN 1986. LNCS, vol.\u00a0254, pp. 413\u2013434. Springer, Heidelberg (1987)"},{"key":"26_CR13","first-page":"55","volume-title":"FOCS 1967","author":"R.M. Karp","year":"1967","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata: A mathematical model for parallel computation. In: FOCS 1967, pp. 55\u201361. IEEE Computer Society Press, Los Alamitos (1967)"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/800070.802201","volume-title":"STOC 1982","author":"S.R. Kosaraju","year":"1982","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC 1982, pp. 267\u2013281. ACM Press, New York (1982)"},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1145\/322077.322079","volume":"25","author":"L.H. Landweber","year":"1978","unstructured":"Landweber, L.H., Robertson, E.L.: Properties of conflict-free and persistent Petri nets. J. ACM\u00a025(3), 352\u2013364 (1978)","journal-title":"J. ACM"},{"key":"26_CR16","unstructured":"Homepage of LASH, http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","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 almost everywhere! In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 474\u2013488. Springer, Heidelberg (2005)"},{"key":"26_CR18","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 Inf.\u00a015, 309\u2013318 (1981)","journal-title":"Acta Inf."},{"issue":"3","key":"26_CR19","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.\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"key":"26_CR20","volume-title":"Computation: finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Upper Saddle River, NJ, USA (1967)"},{"issue":"3","key":"26_CR21","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., Vidal-Naquet, G.: Petri nets and regular languages. J. Comput. Syst. Sci.\u00a023(3), 299\u2013325 (1981)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:23:26Z","timestamp":1606184606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}