{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T03:30:44Z","timestamp":1789443044072,"version":"build-2803163510"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319245362","type":"print"},{"value":"9783319245379","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-24537-9_8","type":"book-chapter","created":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T05:37:02Z","timestamp":1443591422000},"page":"76-88","source":"Crossref","is-referenced-by-count":3,"title":["The Ideal View on Rackoff\u2019s Coverability Technique"],"prefix":"10.1007","author":[{"given":"Ranko","family":"Lazi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,10,1]]},"reference":[{"issue":"1\/2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"PA Abdulla","year":"2000","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inform. and Comput. 160(1\/2), 109\u2013127 (2000)","journal-title":"Inform. and Comput."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-662-43951-7_2","volume-title":"Automata, Languages, and Programming","author":"M Blondin","year":"2014","unstructured":"Blondin, M., Finkel, A., McKenzie, P.: Handling infinitely branching WSTS. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 13\u201325. Springer, Heidelberg (2014)"},{"key":"8_CR3","unstructured":"Bonnet, R., Finkel, A., Praveen, M.: Extending the Rackoff technique to affine nets. FSTTCS 2012. LIPIcs, vol. 18, pp. 301\u2013312. LZI (2012)"},{"key":"8_CR4","unstructured":"Bonnet, R.: On the cardinality of the set of initial intervals of a partially ordered set. Infinite and finite sets: to Paul Erd\u0151s on his 60th birthday, vol. 1, pp. 189\u2013198. Coll. Math. Soc. J\u00e1nos Bolyai, North-Holland (1975)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-24288-5_10","volume-title":"Reachability Problems","author":"L Bozzelli","year":"2011","unstructured":"Bozzelli, L., Ganty, P.: Complexity analysis of the backward coverability algorithm for VASS. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 96\u2013109. Springer, Heidelberg (2011)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-662-44522-8_19","volume-title":"Mathematical Foundations of Computer Science 2014","author":"J-B Courtois","year":"2014","unstructured":"Courtois, J.-B., Schmitz, S.: Alternating vector addition systems with states. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 220\u2013231. Springer, Heidelberg (2014)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jcss.2012.04.002","volume":"79","author":"S Demri","year":"2013","unstructured":"Demri, S., Jurdzi\u0144ski, M., Lachish, O., Lazi\u0107, R.: The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1), 23\u201338 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s Lemma. In: LICS 2011, pp. 269\u2013278. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.39"},{"issue":"1\u20132","key":"8_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!. Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: Completions. In: Proc. STACS 2009. LIPIcs, vol. 3, pp. 433\u2013444. LZI (2009)","DOI":"10.1007\/978-3-642-02930-1_16"},{"key":"8_CR11","unstructured":"Goubault-Larrecq, J., Karandikar, P., Narayan Kumar, K., Schnoebelen, P.: The ideal approach to computing closed subsets in well-quasi-orderings (in preparation) (2015)"},{"key":"8_CR12","unstructured":"Kochems, J., Ong, C.H.L.: Decidable models of recursive asynchronous concurrency (2015) (preprint) http:\/\/arxiv.org\/abs\/1410.8852"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Lazi\u0107, R., Schmitz, S.: Non-elementary complexities for branching VASS, MELL, and extensions. ACM Trans. Comput. Logic 16(3:20), 1\u201330 (2015)","DOI":"10.1145\/2733375"},{"key":"8_CR14","unstructured":"Lipton, R.: The reachability problem requires exponential space. Tech. Rep. 62, Yale University (1976)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-40184-8_12","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"R Majumdar","year":"2013","unstructured":"Majumdar, R., Wang, Z.: Expand, Enlarge, and Check for Branching Vector Addition Systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 \u2013 Concurrency Theory. LNCS, vol. 8052, pp. 152\u2013166. Springer, Heidelberg (2013)"},{"issue":"2","key":"8_CR16","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. 6(2), 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR17","unstructured":"Schmitz, S.: Complexity hierarchies beyond Elementary (2013) (preprint) http:\/\/arxiv.org\/abs\/1312.5686"},{"key":"8_CR18","unstructured":"Schmitz, S., Schnoebelen, P.: Algorithmic aspects of WQO theory. Lecture notes (2012). http:\/\/cel.archives-ouvertes.fr\/cel-00727025"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616\u2013628. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24537-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T09:25:53Z","timestamp":1653211553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24537-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319245362","9783319245379"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24537-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}