{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:17:22Z","timestamp":1784837842470,"version":"3.55.0"},"publisher-location":"Cham","reference-count":70,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319459936","type":"print"},{"value":"9783319459943","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-45994-3_1","type":"book-chapter","created":{"date-parts":[[2016,9,12]],"date-time":"2016-09-12T09:41:04Z","timestamp":1473673264000},"page":"1-22","source":"Crossref","is-referenced-by-count":2,"title":["The Ideal Theory for WSTS"],"prefix":"10.1007","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"key":"1_CR1","series-title":"LNCS","first-page":"305","volume-title":"CAV 1898","author":"P Abdulla","year":"1998","unstructured":"Abdulla, P., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy Fifo channels. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1898. LNCS, vol. 1427, pp. 305\u2013318. Springer, Heidelberg (1998)"},{"issue":"1","key":"1_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/B:FORM.0000033962.51898.1a","volume":"25","author":"PA Abdulla","year":"2004","unstructured":"Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Methods Syst. Des. 25(1), 39\u201365 (2004)","journal-title":"Formal Methods Syst. Des."},{"issue":"1\u20132","key":"1_CR3","doi-asserted-by":"crossref","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. Inf. Comput. 160(1\u20132), 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Yih-Kuen, T.: General decidability theorems for infinite-state systems. In: 11th LICS, pp. 313\u2013321 (1996)","DOI":"10.1109\/LICS.1996.561359"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-540-74915-8_11","volume-title":"Computer Science Logic","author":"PA Abdulla","year":"2007","unstructured":"Abdulla, P.A., Delzanno, G., Van Begin, L.: Comparing the expressive power of well-structured transition systems. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 99\u2013114. Springer, Heidelberg (2007)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-3-540-30206-3_24","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"PA Abdulla","year":"2004","unstructured":"Abdulla, P.A., Deneux, J., Mahata, P., Nyl\u00e9n, A.: Forward reachability analysis of timed Petri nets. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT 2004. LNCS, vol. 3253, pp. 343\u2013362. Springer, Heidelberg (2004)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Jonsson, B.: Verifying programs with unreliable channels. In: Proceedings of the 8th LICS, pp. 160\u2013170 (1993)","DOI":"10.1109\/LICS.1993.287591"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 3, pp. 1\u2013168. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"issue":"4","key":"1_CR9","doi-asserted-by":"crossref","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 15(4), 381\u2013394 (1978)","journal-title":"Calcolo"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Better is better than well: on efficient verification of infinite-state systems. In: Proceedings of 14th IEEE Symposium, LICS 2000, pp. 132\u2013140 (2000)","DOI":"10.1109\/LICS.2000.855762"},{"key":"1_CR11","unstructured":"Bertrand, N., Delzanno, G., K\u00f6nig, B., Sangnier, A., St\u00fcckrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: Tiwari, A. (ed.) 23rd RTA 2012, Nagoya, Japan, 28 May\u20132 June 2012. LIPIcs, vol. 15, pp. 101\u2013116. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-642-19805-2_11","volume-title":"Foundations of Software Science and Computational Structures","author":"R Bonnet","year":"2011","unstructured":"Bonnet, R., Finkel, A., Haddad, S., Rosa-Velardo, F.: Ordinal theory for expressiveness of well structured transition systems. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 153\u2013167. Springer, Heidelberg (2011)"},{"key":"1_CR13","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":"1_CR14","doi-asserted-by":"crossref","unstructured":"Blondin, M., Finkel, A., McKenzie, P.: Well Behaved Transition Systems (2016, in preparation)","DOI":"10.23638\/LMCS-13(3:24)2017"},{"key":"1_CR15","unstructured":"Blondin, M., Finkel, A., McKenzie, P.: Handling infinitely branching well-structured transition systems. Inf. Comput. (2016, submitted)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","year":"2014","unstructured":"Baldan, P., Gorla, D. (eds.): CONCUR 2014. LNCS, vol. 8704. Springer, Heidelberg (2014)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-319-19488-2_11","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"E Badouel","year":"2015","unstructured":"Badouel, E., H\u00e9lou\u00ebt, L., Morvan, C.: Petri nets with structured data. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 212\u2013233. Springer, Heidelberg (2015)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24537-9_7","volume-title":"Reachability Problems","year":"2015","unstructured":"Bojanczyk, M., Lasota, S., Potapov, I. (eds.): RP 2015. LNCS, vol. 9328. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-24537-9_7"},{"key":"1_CR19","unstructured":"Bonnet, R.: On the cardinality of the set of initial intervals of a partially ordered set. In: Infinite, Finite Sets: To Paul Erd\u00f6s on His 60th Birthday, pp. 189\u2013198 (1975)"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6709, pp. 49\u201368. Springer, Heidelberg (2011)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Automata, Languages and Programming","author":"C Dufourd","year":"1999","unstructured":"Dufourd, C., Jan\u010dar, P., Schnoebelen, P.: Boundedness of reset P\/T nets. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 301\u2013310. Springer, Heidelberg (1999)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: 14th LICS, pp. 352\u2013359 (1999)","DOI":"10.1109\/LICS.1999.782630"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Allen Emerson, E., Namjoshi, K.S.: On model-checking for non-deterministic infinite-state systems. In: 13th LICS, pp. 70\u201380 (1998)","DOI":"10.1109\/LICS.1998.705644"},{"issue":"44","key":"1_CR25","doi-asserted-by":"crossref","first-page":"315","DOI":"10.2307\/1968767","volume":"2","author":"P Erd\u00f6s","year":"1943","unstructured":"Erd\u00f6s, P., Tarski, A.: On families of mutually exclusive sets. Ann. Math. 2(44), 315\u2013329 (1943)","journal-title":"Ann. Math."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s lemma. In: 26th Annual IEEE LICS, Toronto, Ontario, Canada, 21\u201324 June 2011, pp. 269\u2013278. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.39"},{"key":"1_CR27","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: completions. In: Albers, S., Marion, J.-Y. (eds.) 26th Annual STACS 2009. Leibniz International Proceedings in Informatics, vol. 3, pp. 433\u2013444. Leibniz-Zentrum f\u00fcr Informatik, Freiburg (2009)"},{"key":"1_CR28","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":"Automata, Languages and Programming","author":"A Finkel","year":"2009","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part\u00a0II: complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 188\u2013199. Springer, Heidelberg (2009)"},{"issue":"3:28","key":"1_CR29","first-page":"1","volume":"8","author":"A Finkel","year":"2012","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part II: complete WSTS. Logical Methods Comput. Sci. 8(3:28), 1\u201335 (2012)","journal-title":"Logical Methods Comput. Sci."},{"key":"1_CR30","series-title":"LNCS","first-page":"499","volume-title":"ICALP 1987","author":"A Finkel","year":"1987","unstructured":"Finkel, A.: A generalization of the procedure of Karp and Miller to well structured transition systems. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 499\u2013508. Springer, Heidelberg (1987)"},{"issue":"2","key":"1_CR31","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A Finkel","year":"1990","unstructured":"Finkel, A.: Reduction and covering of infinite reachability trees. Inf. Comput. 89(2), 144\u2013179 (1990)","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"1_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2004.01.005","volume":"195","author":"A Finkel","year":"2004","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing Petri net extensions. Inf. Comput. 195(1\u20132), 1\u201329 (2004)","journal-title":"Inf. Comput."},{"key":"1_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0049-237X(08)70967-4","volume":"118","author":"R Fra\u00efss\u00e9","year":"1986","unstructured":"Fra\u00efss\u00e9, R.: Theory of relations. Stud. Logic Found. Math. 118, 1\u2013456 (1986)","journal-title":"Stud. Logic Found. Math."},{"issue":"1\u20132","key":"1_CR34","doi-asserted-by":"crossref","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!. Theoret. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous lattices and domains. In: Encyclopedia of Mathematics and its Applications, vol. 93. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511542725"},{"key":"1_CR36","unstructured":"Goubault-Larrecq, J., Schmitz, S.: Deciding piecewise testable separability for regular tree languages. In: Calamoneri, T., Gorla, D., Rabani, Y., Sangiorgi, D., Mitzenmacher, M. (eds.) 43rd ICALP 2016, Proceedings Leibniz International Proceedings in Informatics, Rome, Italy, 12\u201315 July 2016, pp. 97:1\u201397:14. Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-540-30538-5_24","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"G Geeraerts","year":"2004","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, enlarge, and check: new algorithms for the coverability problem of WSTS. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 287\u2013298. Springer, Heidelberg (2004)"},{"issue":"3\u20134","key":"1_CR38","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00236-007-0050-3","volume":"44","author":"G Geeraerts","year":"2007","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: Well-structured languages. Acta Inf. 44(3\u20134), 249\u2013288 (2007)","journal-title":"Acta Inf."},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","first-page":"49","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Ganty","year":"2006","unstructured":"Ganty, P., Raskin, J.-F., Van Begin, L.: A complete abstract interpretation framework for coverability properties of WSTS. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 49\u201364. Springer, Heidelberg (2006)"},{"issue":"1","key":"1_CR40","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.jcss.2005.09.001","volume":"72","author":"G Geeraerts","year":"2006","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, enlarge and check: new algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72(1), 180\u2013203 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-540-75596-8_9","volume-title":"Automated Technology for Verification and Analysis","author":"G Geeraerts","year":"2007","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the efficient computation of the minimal coverability set for Petri nets. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 98\u2013113. Springer, Heidelberg (2007)"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-662-49630-5_26","volume-title":"Foundations of Software Science and Computation Structures","author":"P Hofman","year":"2016","unstructured":"Hofman, P., Lasota, S., Lazic, R., Leroux, J., Schmitz, S., Totzke, P.: Coverability trees for Petri nets with unordered data. In: Jacobs, B., L\u00f6ding, C. (eds.) FOSSACS 2016. LNCS, vol. 9634, pp. 445\u2013461. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49630-5_26"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"H\u00fcchting, R., Majumdar, R., Meyer, R.: Bounds on mobility. In: Baldan and Gorla [BG14], pp. 357\u2013371","DOI":"10.1007\/978-3-662-44584-6_25"},{"issue":"7\u20138","key":"1_CR44","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s00236-007-0055-y","volume":"44","author":"S Haddad","year":"2007","unstructured":"Haddad, S., Poitrenaud, D.: Recursive Petri nets. Acta Inf. 44(7\u20138), 463\u2013508 (2007)","journal-title":"Acta Inf."},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal-recursive complexity of timed-arc petri nets, data nets, and other enriched nets. In: 27th Annual IEEE LICS, Dubrovnik, Croatia, 25\u201328 June 2012, pp. 355\u2013364. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.46"},{"issue":"5\u20136","key":"1_CR46","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0020-0190(99)00149-0","volume":"72","author":"P Jan\u010dar","year":"1999","unstructured":"Jan\u010dar, P.: A note on well quasi-orderings for powersets. Inf. Process. Lett. 72(5\u20136), 155\u2013160 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1_CR47","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR48","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S1571-0661(05)82512-5","volume":"5","author":"O Kouchnarenko","year":"1996","unstructured":"Kouchnarenko, O., Schnoebelen, P.: A model for recursive-parallel programs. Electron. Notes Theor. Comput. Sci. 5, 30 (1996)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B., St\u00fcckrath, J.: A general framework for well-structured graph transformation systems. In: Baldan and Gorla [BG14], pp. 467\u2013481","DOI":"10.1007\/978-3-662-44584-6_32"},{"key":"1_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-39086-4_3","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"S Lasota","year":"2016","unstructured":"Lasota, S.: Decidability border for Petri nets with data: WQO dichotomy conjecture. In: Kordon, F., Moldt, D. (eds.) PETRI NETS 2016. LNCS, vol. 9698, pp. 20\u201336. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-39086-4_3"},{"key":"1_CR51","unstructured":"Lazi\u0107, R.: The reachability problem for vector addition systems with a stack is not elementary. CoRR, abs\/1310.1767 (2013)"},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/978-3-540-73094-1_19","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"RS Lazi\u0107","year":"2007","unstructured":"Lazi\u0107, R.S., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.B.: Nets with tokens which carry data. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 301\u2013320. Springer, Heidelberg (2007)"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"Lazi\u0107, R., Schmitz, S.: The ideal view on rackoff\u2019s coverability technique. In: Bojanczyk et al. [BLP15], pp. 76\u201388","DOI":"10.1007\/978-3-319-24537-9_8"},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Demystifying reachability in vector addition systems. In: 30th Annual ACM\/IEEE LICS, Kyoto, Japan, 6\u201310 July 2015, pp. 56\u201367. IEEE Computer Society (2015)","DOI":"10.1109\/LICS.2015.16"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Lazi\u0107, R., Schmitz, S.: The complexity of coverability in -Petri nets. In: LICS 2016. ACM Press, New York (2016)","DOI":"10.1145\/2933575.2933593"},{"key":"1_CR56","unstructured":"Leroux, J., Schmitz, S.: Ideal decompositions for vector addition systems (invited talk). In: Ollinger, N., Vollmer, H. (eds.) 33rd STACS 2016, Orl\u00e9ans, France, 17\u201320 February 2016. LIPIcs, vol. 47, pp. 1:1\u20131:13 (2016)"},{"key":"1_CR57","doi-asserted-by":"crossref","unstructured":"Leroux, J., Sutre, G., Totzke, P.: On boundedness problems for pushdown vector addition systems. In: Bojanczyk et al. [BLP15], pp. 101\u2013113","DOI":"10.1007\/978-3-319-24537-9_10"},{"key":"1_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-662-47666-6_26","volume-title":"Automata, Languages, and Programming","author":"J Leroux","year":"2015","unstructured":"Leroux, J., Sutre, G., Totzke, P.: On the coverability problem for pushdown vector addition systems in one dimension. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 324\u2013336. Springer, Heidelberg (2015)"},{"issue":"2","key":"1_CR59","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1090\/S0002-9947-1994-1219735-8","volume":"345","author":"A Marcone","year":"1994","unstructured":"Marcone, A.: Foundations of BQO theory. Trans. Am. Math. Soc. 345(2), 641\u2013660 (1994)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20132","key":"1_CR60","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Inf. Comput. 156(1\u20132), 264\u2013286 (2000)","journal-title":"Inf. Comput."},{"key":"1_CR61","series-title":"IFIP","first-page":"477","volume-title":"TCS 2008","author":"R Meyer","year":"2008","unstructured":"Meyer, R.: On boundedness in depth in the pi-calculus. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Luke Ong, C.-H. (eds.) TCS 2008. IFIP, vol. 273, pp. 477\u2013489. Springer, Heidelberg (2008)"},{"key":"1_CR62","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1112\/S0025579300000565","volume":"1","author":"R Rado","year":"1954","unstructured":"Rado, R.: Partial well-ordering of sets of vectors. Mathematika 1, 89\u201395 (1954)","journal-title":"Mathematika"},{"key":"1_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/978-3-540-73094-1_24","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"F Rosa-Velardo","year":"2007","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Name creation vs. replication in Petri net systems. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 402\u2013422. Springer, Heidelberg (2007)"},{"key":"1_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-3-642-14322-9_19","volume-title":"The Mathematics of Language","author":"J Rogers","year":"2010","unstructured":"Rogers, J., Heinz, J., Bailey, G., Edlefsen, M., Visscher, M., Wellcome, D., Wibel, S.: On languages piecewise testable in the strict sense. In: Ebert, C., J\u00e4ger, G., Michaelis, J. (eds.) MOL 10\/11. LNCS, vol. 6149, pp. 255\u2013265. Springer, Heidelberg (2010)"},{"issue":"3\u20134","key":"1_CR65","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3233\/FI-2011-611","volume":"113","author":"F Rosa-Velardo","year":"2011","unstructured":"Rosa-Velardo, F., Martos-Salgado, M., de Frutos-Escrig, D.: Accelerations for the coverability set of Petri nets with names. Fundam. Inform. 113(3\u20134), 313\u2013341 (2011)","journal-title":"Fundam. Inform."},{"issue":"2","key":"1_CR66","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner\u2019s conjecture. J. Comb. Theory Ser. B 92(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/978-3-642-22012-8_35","volume-title":"Automata, Languages and Programming","author":"S Schmitz","year":"2011","unstructured":"Schmitz, S., Schnoebelen, P.: Multiply-recursive upper bounds with Higman\u2019s Lemma. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 441\u2013452. Springer, Heidelberg (2011)"},{"key":"1_CR68","series-title":"LNCS","first-page":"464","volume-title":"ICALP 1978","author":"R Valk","year":"1978","unstructured":"Valk, R.: Self-modidying nets, a natural extension of Petri nets. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 464\u2013476. Springer, Heidelberg (1978)"},{"key":"1_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/978-3-642-12032-9_8","volume-title":"Foundations of Software Science and Computational Structures","author":"T Wies","year":"2010","unstructured":"Wies, T., Zufferey, D., Henzinger, T.A.: Forward analysis of depth-bounded processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 94\u2013108. Springer, Heidelberg (2010)"},{"key":"1_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-642-27940-9_29","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D Zufferey","year":"2012","unstructured":"Zufferey, D., Wies, T., Henzinger, T.A.: Ideal abstractions for well-structured transition systems. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 445\u2013460. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45994-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T18:11:23Z","timestamp":1749579083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45994-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319459936","9783319459943"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45994-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}