{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:17:20Z","timestamp":1784873840099,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642112652","type":"print"},{"value":"9783642112669","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_33","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"394-406","source":"Crossref","is-referenced-by-count":6,"title":["Mixing Coverability and Reachability to Analyze VASS with One Zero-Test"],"prefix":"10.1007","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnaud","family":"Sangnier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-642-00596-1_25","volume-title":"FOSSACS 2009","author":"P.A. Abdulla","year":"2009","unstructured":"Abdulla, P.A., Mayr, R.: Minimal Cost Reachability\/Coverability in Priced Timed Petri Nets. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 348\u2013363. Springer, Heidelberg (2009)"},{"key":"33_CR2","unstructured":"Dufourd, C.: R\u00e9seaux de Petri avec Reset\/Transfert: d\u00e9cidabilit\u00e9 et ind\u00e9cidabilit\u00e9. Th\u00e8se de doctorat, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France (1998)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BFb0058039","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"C. Dufourd","year":"1997","unstructured":"Dufourd, C., Finkel, A.: Polynomial-Time Many-One Reductions for Petri Nets. In: Ramesh, S., Sivakumar, G. (eds.) FST TCS 1997. LNCS, vol.\u00a01346, pp. 312\u2013326. Springer, Heidelberg (1997)"},{"issue":"1","key":"33_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.\u00a031(1), 13\u201325 (1997)","journal-title":"Fundam. Inform."},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-56689-9_45","volume-title":"Advances in Petri Nets 1993","author":"A. Finkel","year":"1993","unstructured":"Finkel, A.: The Minimal Coverability Graph for Petri Nets. In: Rozenberg, G. (ed.) APN 1993. LNCS, vol.\u00a0674, pp. 210\u2013243. Springer, Heidelberg (1993)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/978-3-642-02930-1_16","volume-title":"ICALP 2009, Part II","author":"A. Finkel","year":"2009","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part\u00a0II: Complete WSTS. In: Albers, S., et al. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 188\u2013199. Springer, Heidelberg (2009)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-85238-4_26","volume-title":"Mathematical Foundations of Computer Science 2008","author":"A. Finkel","year":"2008","unstructured":"Finkel, A., Sangnier, A.: Reversal-Bounded Counter Machines Revisited. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 323\u2013334. Springer, Heidelberg (2008)"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Finkel, A., Sangnier, A.: Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. Research Report, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan (2009)","DOI":"10.1007\/978-3-642-11266-9_33"},{"key":"33_CR9","unstructured":"Hack, M.: Petri Net Language. Technical Report, Massachusetts Institute of Technology (1976)"},{"issue":"1","key":"33_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"},{"key":"33_CR11","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, Los Alamitos (1967)"},{"key":"33_CR12","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, New York (1982)"},{"key":"33_CR13","first-page":"4","volume-title":"LICS 2009","author":"J. Leroux","year":"2009","unstructured":"Leroux, J.: The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. In: LICS 2009, pp. 4\u201313. IEEE Computer Society Press, Los Alamitos (2009)"},{"issue":"3","key":"33_CR14","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":"33_CR15","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 (1967)"},{"issue":"4","key":"33_CR16","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On Context-Free Languages. Journal of the ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"Journal of the ACM"},{"key":"33_CR17","unstructured":"http:\/\/www.informatik.uni-hamburg.de\/TGI\/PetriNets\/"},{"key":"33_CR18","first-page":"239","volume":"223","author":"K. Reinhardt","year":"2008","unstructured":"Reinhardt, K.: Reachability in Petri Nets with Inhibitor Arcs. ENTCS\u00a0223, 239\u2013264 (2008)","journal-title":"ENTCS"},{"issue":"3","key":"33_CR19","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","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,24]],"date-time":"2020-05-24T02:58:18Z","timestamp":1590289098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}