{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:44:19Z","timestamp":1773654259843,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679011","type":"print"},{"value":"9783540446125","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_31","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"353-362","source":"Crossref","is-referenced-by-count":6,"title":["An Algorithm Constructing the Semilinear Post for 2-Dim Reset\/Transfer VASS"],"prefix":"10.1007","author":[{"given":"A.","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Sutre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"31_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-49116-3_30","volume-title":"Proc. 16th Ann. Symp. Theoretical Aspects of Computer Science (STACS\u201999), Trier, Germany, Mar. 1999","author":"A. Bouajjani","year":"1999","unstructured":"A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Proc. 16th Ann. Symp. Theoretical Aspects of Computer Science (STACS\u201999), Trier, Germany, Mar. 1999, volume 1563 of Lecture Notes in Computer Science, pages 323\u2013333. Springer, 1999."},{"key":"31_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP\u201998), Aalborg, Denmark, July 1998","author":"C. Dufourd","year":"1998","unstructured":"C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset nets between decidability and undecidability. In Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP\u201998), Aalborg, Denmark, July 1998, volume 1443 of Lecture Notes in Computer Science, pages 103\u2013115. Springer, 1998."},{"key":"31_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP\u201999), Prague, Czech Republic, July 1999","author":"C. Dufourd","year":"1999","unstructured":"C. Dufourd, P. Jan\u010dar, and Ph. Schnoebelen. Boundedness of Reset P\/T nets. In Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP\u201999), Prague, Czech Republic, July 1999, volume 1644 of Lecture Notes in Computer Science, pages 301\u2013310. Springer, 1999."},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A. Finkel","year":"1990","unstructured":"A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144\u2013179, 1990.","journal-title":"Information and Computation"},{"key":"31_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/3-540-46541-3_29","volume-title":"Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS\u20192000), Lille, France, Feb. 2000","author":"A. Finkel","year":"2000","unstructured":"A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. In Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS\u20192000), Lille, France, Feb. 2000, volume 1770 of Lecture Notes in Computer Science, pages 346\u2013357. Springer, 2000."},{"key":"31_CR6","volume-title":"Research Report LSV-2000-7, Lab. Specification and Verification","author":"A. Finkel","year":"2000","unstructured":"A. Finkel and G. Sutre. Verification of two counters automata. Research Report LSV-2000-7, Lab. Specification and Verification, ENS de Cachan, Cachan, France, June 2000."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8:135\u2013159, 1979.","journal-title":"Theoretical Computer Science"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"S. R. Kosaraju. Decidability of reachability in vector addition systems. In Proc. 14th ACM Symp. Theory of Computing (STOC\u201982), San Francisco, CA, May 1982, pages 267\u2013281, 1982.","DOI":"10.1145\/800070.802201"},{"issue":"3","key":"31_CR9","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. W. Mayr","year":"1984","unstructured":"E. W. Mayr. An algorithm for the general Petri net reachability problem. SIAM J. Comput., 13(3):441\u2013460, 1984.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:41:21Z","timestamp":1556376081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}