{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:08:59Z","timestamp":1762297739516},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_13","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:44:46Z","timestamp":1312879486000},"page":"108-119","source":"Crossref","is-referenced-by-count":12,"title":["Model Checking Coverability Graphs of Vector Addition Systems"],"prefix":"10.1007","author":[{"given":"Michel","family":"Blockelet","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1142\/S0129054111008428","volume":"22","author":"M.F. Atig","year":"2011","unstructured":"Atig, M.F., Habermehl, P.: On Yen\u2019s path logic for Petri nets. Int. J. Fund. Comput. Sci.\u00a022(4), 783\u2013799 (2011)","journal-title":"Int. J. Fund. Comput. Sci."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-16242-8_6","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Axelsson","year":"2010","unstructured":"Axelsson, R., Hague, M., Kreutzer, S., Lange, M., Latte, M.: Extended computation tree logic. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 67\u201381. Springer, Heidelberg (2010)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/800113.803630","volume-title":"STOC 1976","author":"E. Cardoza","year":"1976","unstructured":"Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups. In: STOC 1976, pp. 50\u201354. ACM Press, New York (1976)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-21834-7_4","volume-title":"Applications and Theory of Petri Nets","author":"P. Chambart","year":"2011","unstructured":"Chambart, P., Finkel, A., Schmitz, S.: Forward analysis and model checking for trace bounded WSTS. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol.\u00a06709, pp. 49\u201368. Springer, Heidelberg (2011)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Demri, S.: On selective unboundedness of VASS. INFINITY 2010. Elec. Proc. In: Elec. Proc. in Theor. Comput. Sci., vol.\u00a039, pp. 1\u201315 (2010)","DOI":"10.4204\/EPTCS.39.1"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Decidability of model checking for infinite-state concurrent systems. Acta Inf.\u00a034(2), 85\u2013107 (1997)","journal-title":"Acta Inf."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s Lemma. LICS 2011. IEEE, Los Alamitos (2011)","DOI":"10.1109\/LICS.2011.39"},{"key":"13_CR8","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":"13_CR9","first-page":"102","volume-title":"POPL 2009","author":"P. Ganty","year":"2009","unstructured":"Ganty, P., Majumdar, R., Rybalchenko, A.: Verifying liveness for asynchronous programs. In: POPL 2009, pp. 102\u2013113. ACM Press, New York (2009)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/3-540-63139-9_32","volume-title":"ICATPN 1997","author":"P. Habermehl","year":"1997","unstructured":"Habermehl, P.: On the complexity of the linear-time \u03bc-calculus for Petri nets. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol.\u00a01248, pp. 102\u2013116. Springer, Heidelberg (1997)"},{"key":"13_CR11","series-title":"Computation Structures Group Memo 95, Project MAC","volume-title":"Decision problems for Petri nets and vector addition systems","author":"M. Hack","year":"1974","unstructured":"Hack, M.: Decision problems for Petri nets and vector addition systems. Computation Structures Group Memo 95, Project MAC. MIT, Cambridge (1974)"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci.\u00a08(2), 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-642-14295-6_55","volume-title":"Computer Aided Verification","author":"A. Kaiser","year":"2010","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Dynamic cutoff detection in parameterized concurrent programs. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 645\u2013659. Springer, Heidelberg (2010)"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J.\u00a0Comput. Syst. Sci.\u00a03(2), 147\u2013195 (1969)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"13_CR15","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. In: STOC 1982, pp. 267\u2013281. ACM Press, New York (1982)"},{"key":"13_CR16","first-page":"307","volume-title":"POPL 2011","author":"J. Leroux","year":"2011","unstructured":"Leroux, J.: Vector addition system reachability problem: a short self-contained proof. In: POPL 2011, pp. 307\u2013316. ACM Press, New York (2011)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/800076.802477","volume-title":"STOC 1981","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC 1981, pp. 238\u2013246. ACM Press, New York (1981)"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci.\u00a06(2), 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","volume":"32","author":"L.E. Rosier","year":"1986","unstructured":"Rosier, L.E., Yen, H.C.: A multiparameter analysis of the boundedness problem for vector addition systems. J.\u00a0Comput. Syst. Sci.\u00a032(1), 105\u2013135 (1986)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"3","key":"13_CR20","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.\u00a0Comput. Syst. Sci.\u00a023(3), 299\u2013325 (1981)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"5","key":"13_CR21","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0747-7171(08)80051-X","volume":"10","author":"V. Weispfenning","year":"1990","unstructured":"Weispfenning, V.: The complexity of almost linear Diophantine problems. J.\u00a0Symb. Comput.\u00a010(5), 395\u2013403 (1990)","journal-title":"J.\u00a0Symb. Comput."},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0890-5401(92)90059-O","volume":"96","author":"H.C. Yen","year":"1992","unstructured":"Yen, H.C.: A unified approach for deciding the existence of certain Petri net paths. Inform. and Comput.\u00a096(1), 119\u2013137 (1992)","journal-title":"Inform. and Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:10:11Z","timestamp":1606169411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}