{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:09:31Z","timestamp":1762297771693},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242878"},{"type":"electronic","value":"9783642242885"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24288-5_10","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T05:46:57Z","timestamp":1316843217000},"page":"96-109","source":"Crossref","is-referenced-by-count":16,"title":["Complexity Analysis of the Backward Coverability Algorithm for VASS"],"prefix":"10.1007","author":[{"given":"Laura","family":"Bozzelli","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Ganty","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"313","volume-title":"LICS 1996","author":"P. Abdulla","year":"1996","unstructured":"Abdulla, P., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.: General Decidability Theorems for Infinite-State Systems. In: LICS 1996, pp. 313\u2013321. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02576519","volume":"15","author":"A. Arnold","year":"1978","unstructured":"Arnold, A., Latteux, M.: Recursivite et cones rationnels fermes par intersection. Calcolo\u00a015, 381\u2013394 (1978)","journal-title":"Calcolo"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-46419-0_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Delzanno","year":"2000","unstructured":"Delzanno, G., Raskin, J.-F.: Symbolic representation of upward-closed sets. In: Graf, S. (ed.) TACAS 2000. LNCS, vol.\u00a01785, pp. 426\u2013440. Springer, Heidelberg (2000)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-44585-4_28","volume-title":"Computer Aided Verification","author":"G. Delzanno","year":"2001","unstructured":"Delzanno, G., Raskin, J.-F., Van Begin, L.: Attacking symbolic state explosion. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 298\u2013310. Springer, Heidelberg (2001)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics\u00a035, 413\u2013422 (1913)","journal-title":"American Journal of Mathematics"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J. Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and Complexity of Petri Net Problems - An Introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 374\u2013428. Springer, Heidelberg (1998)"},{"issue":"3","key":"10_CR7","first-page":"143","volume":"30","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Journal of Informatik Processing and Cybernetics\u00a030(3), 143\u2013160 (1994)","journal-title":"Journal of Informatik Processing and Cybernetics"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/LICS.2011.39","volume-title":"LICS 2011: Proc. 26th Annual IEEE Symp. on Logic in Computer Science","author":"D. Figueira","year":"2011","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s lemma. In: LICS 2011: Proc. 26th Annual IEEE Symp. on Logic in Computer Science, pp. 269\u2013278. IEEE Computer Society Press, Los Alamitos (2011)"},{"issue":"1-2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"10_CR10","unstructured":"Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. CoRR, abs\/1011.0551 (2010)"},{"issue":"7","key":"10_CR11","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. Proceedings of the London Mathematical Society (3)\u00a02(7), 326\u2013336 (1952)","journal-title":"Proceedings of the London Mathematical Society (3)"},{"issue":"2","key":"10_CR12","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. Journal of Comput. Syst. Sci.\u00a03(2), 147\u2013195 (1969)","journal-title":"Journal of Comput. Syst. Sci."},{"key":"10_CR13","unstructured":"Lipton, R.: The Reachability Problem Requires Exponential Space. Technical Report 62, Yale University (1976)"},{"key":"10_CR14","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. Theoretical Computer Science\u00a06, 223\u2013231 (1978)","journal-title":"Theoretical Computer Science"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/11817963_29","volume-title":"Computer Aided Verification","author":"K. Sen","year":"2006","unstructured":"Sen, K., Viswanathan, M.: Model checking multithreaded programs with asynchronous atomic methods. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 300\u2013314. Springer, Heidelberg (2006)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/BF00289715","volume":"21","author":"R. Valk","year":"1985","unstructured":"Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in Petri nets. Acta Informatica\u00a021, 643\u2013674 (1985)","journal-title":"Acta Informatica"},{"issue":"24-25","key":"10_CR17","doi-asserted-by":"publisher","first-page":"2442","DOI":"10.1016\/j.tcs.2009.02.036","volume":"410","author":"H.-C. Yen","year":"2009","unstructured":"Yen, H.-C., Chen, C.-L.: On minimal elements of upward-closed sets. Theoretical Computer Science\u00a0410(24-25), 2442\u20132452 (2009)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24288-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T20:32:22Z","timestamp":1554669142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24288-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242878","9783642242885"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24288-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}