{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T14:11:14Z","timestamp":1791209474529,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401831","type":"print"},{"value":"9783642401848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_2","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"5-24","source":"Crossref","is-referenced-by-count":28,"title":["The Power of Well-Structured Systems"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Schmitz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Schnoebelen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2178\/bsl\/1294171129","volume":"16","author":"P.A. Abdulla","year":"2010","unstructured":"Abdulla, P.A.: Well (and better) quasi-ordered transition systems. Bull. Symbolic Logic\u00a016(4), 457\u2013515 (2010)","journal-title":"Bull. Symbolic Logic"},{"issue":"1\/2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. 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.\u00a0160(1\/2), 109\u2013127 (2000)","journal-title":"Inform. and Comput."},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.ic.2010.11.003","volume":"209","author":"P.A. Abdulla","year":"2011","unstructured":"Abdulla, P.A., Delzanno, G., Van Begin, L.: A classification of the expressive power of well-structured transition systems. Inform. and Comput.\u00a0209(3), 248\u2013279 (2011)","journal-title":"Inform. and Comput."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inform. and Comput.\u00a0127(2), 91\u2013101 (1996)","journal-title":"Inform. and Comput."},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-32621-9_9","volume-title":"Logic, Language, Information and Computation","author":"S. Abriola","year":"2012","unstructured":"Abriola, S., Figueira, S., Senno, G.: Linearizing bad sequences: upper bounds for the product and majoring well quasi-orders. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol.\u00a07456, pp. 110\u2013126. Springer, Heidelberg (2012)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Atig, M.F., Bouajjani, A., Burckhardt, S., Musuvathi, M.: On the verification problem for weak memory models. In: POPL 2010, pp. 7\u201318. ACM (2010)","DOI":"10.1145\/1707801.1706303"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Barcel\u00f3, P., Figueira, D., Libkin, L.: Graph logics with rational relations and the generalized intersection problem. In: LICS 2012, pp. 115\u2013124. IEEE Press (2012)","DOI":"10.1109\/LICS.2012.23"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Bertrand, N., Schnoebelen, P.: Computable fixpoints in well-structured symbolic model checking. Form. Methods in Syst. Des. (to appear, 2013)","DOI":"10.1007\/s10703-012-0168-y"},{"key":"2_CR9","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.\u00a06945, pp. 96\u2013109. Springer, Heidelberg (2011)"},{"key":"2_CR10","unstructured":"Bresolin, D., Della Monica, D., Montanari, A., Sala, P., Sciavicco, G.: Interval temporal logics over finite linear orders: The complete picture. In: ECAI 2012. Frontiers in Artificial Intelligence and Applications, vol.\u00a0242, pp. 199\u2013204. IOS (2012)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Cardoza, E., Lipton, R., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative subgroups. In: STOC 1976, pp. 50\u201354. ACM (1976)","DOI":"10.1145\/800113.803630"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-77050-3_22","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"P. Chambart","year":"2007","unstructured":"Chambart, P., Schnoebelen, P.: Post embedding problem is not primitive recursive, with applications to channel systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 265\u2013276. Springer, Heidelberg (2007)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: LICS 2008, pp. 205\u2013216. IEEE Press (2008)","DOI":"10.1109\/LICS.2008.47"},{"issue":"1-2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(97)00009-1","volume":"201","author":"E.A. Cicho\u0144","year":"1998","unstructured":"Cicho\u0144, E.A., Tahhan Bittar, E.: Ordinal recursive bounds for Higman\u2019s Theorem. Theor. Comput. Sci.\u00a0201(1-2), 63\u201384 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(86)90169-6","volume":"43","author":"P. Clote","year":"1986","unstructured":"Clote, P.: On the finite containment problem for Petri nets. Theor. Comput. Sci.\u00a043, 99\u2013105 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","unstructured":"Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: LICS 1998, pp. 70\u201380. IEEE Press (1998)"},{"key":"2_CR17","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS 1999, pp. 352\u2013359. IEEE Press (1999)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-39799-8_8","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"2013","unstructured":"Esparza, J., Ganty, P., Majumdar, R.: Parameterized verification of asynchronous shared-memory systems. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 124\u2013140. Springer, Heidelberg (2013)"},{"issue":"1","key":"2_CR19","first-page":"22","volume":"8","author":"D. Figueira","year":"2012","unstructured":"Figueira, D.: Alternating register automata on finite words and trees. Logic. Meth. in Comput. Sci.\u00a08(1), 22 (2012)","journal-title":"Logic. Meth. in Comput. Sci."},{"key":"2_CR20","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 Press (2011)","DOI":"10.1109\/LICS.2011.39"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-18088-5_43","volume-title":"Automata, Languages and Programming","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.\u00a0267, pp. 499\u2013508. Springer, Heidelberg (1987)"},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02277857","volume":"7","author":"A. Finkel","year":"1994","unstructured":"Finkel, A.: Decidability of the termination problem for completely specificied protocols. Distributed Computing\u00a07(3), 129\u2013135 (1994)","journal-title":"Distributed Computing"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for\u00a0WSTS, part\u00a0II: Complete WSTS. Logic. Meth. in Comput. Sci.\u00a08(4:28) (2012)","DOI":"10.2168\/LMCS-8(3:28)2012"},{"issue":"1-2","key":"2_CR24","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.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR25","unstructured":"Goubault-Larrecq, J.: On a generalization of a result by Valk and Jantzen. Research Report LSV-09-09, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France (2009)"},{"key":"2_CR26","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/978-3-642-40184-8_2","volume-title":"CONCUR 2013","author":"S. Schmitz","year":"2013","unstructured":"Schmitz, S., Schnoebelen, P.: The power of well-structured systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol.\u00a08052, pp. 5\u201324. Springer, Heidelberg (2013)"},{"key":"2_CR27","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: LICS 2012, pp. 355\u2013364. IEEE Press (2012)","DOI":"10.1109\/LICS.2012.46"},{"issue":"1-2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(00)00100-6","volume":"256","author":"P. Jan\u010dar","year":"2001","unstructured":"Jan\u010dar, P.: Nonprimitive recursive complexity and undecidability for Petri net equivalences. Theor. Comput. Sci.\u00a0256(1-2), 23\u201330 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, M., Lazi\u0107, R.: Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Logic\u00a012(3) (2011)","DOI":"10.1145\/1929954.1929956"},{"issue":"3","key":"2_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"J.B. Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: A frequently discovered concept. J.\u00a0Comb. Theory A\u00a013(3), 297\u2013305 (1972)","journal-title":"J.\u00a0Comb. Theory A"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Kurucz, A.: Combining modal logics. In: Handbook of Modal Logics, ch. 15, pp. 869\u2013926. Elsevier Science (2006)","DOI":"10.1016\/S1570-2464(07)80018-8"},{"issue":"2","key":"2_CR32","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1342991.1342994","volume":"9","author":"S. Lasota","year":"2008","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Comput. Logic\u00a09(2), 10 (2008)","journal-title":"ACM Trans. Comput. Logic"},{"key":"2_CR33","unstructured":"Lazi\u0107, R., Ouaknine, J., Worrell, J.: Zeno, Hercules and the Hydra: Downward rational termination is Ackermannian. In: MFCS 2013. LNCS. Springer (to appear, 2013)"},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01967649","volume":"13","author":"M. L\u00f6b","year":"1970","unstructured":"L\u00f6b, M., Wainer, S.: Hierarchies of number theoretic functions. I. Arch. Math. Logic\u00a013, 39\u201351 (1970)","journal-title":"I. Arch. Math. Logic"},{"issue":"3","key":"2_CR35","first-page":"561","volume":"28","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the finite containment problem for Petri nets. J.\u00a0ACM\u00a028(3), 561\u2013576 (1981)","journal-title":"J.\u00a0ACM"},{"issue":"1-2","key":"2_CR36","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(84)90029-X","volume":"32","author":"K. McAloon","year":"1984","unstructured":"McAloon, K.: Petri nets and large finite sets. Theor. Comput. Sci.\u00a032(1-2), 173\u2013183 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Milner, R.: Operational and algebraic semantics of concurrent processes. In: Handbook of Theoretical Computer Science, ch. 19, pp. 1201\u20131242. Elsevier Science (1990)","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"issue":"1","key":"2_CR38","first-page":"8","volume":"3","author":"J. Ouaknine","year":"2007","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of Metric Temporal Logic over finite words. Logic. Meth. in Comput. Sci.\u00a03(1), 8 (2007)","journal-title":"Logic. Meth. in Comput. Sci."},{"issue":"2","key":"2_CR39","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."},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06756, pp. 441\u2013452. Springer, Heidelberg (2011)"},{"key":"2_CR41","unstructured":"Schmitz, S., Schnoebelen, P.: Algorithmic aspects of wqo theory. Lecture notes (2012), http:\/\/cel.archives-ouvertes.fr\/cel-00727025"},{"key":"2_CR42","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.\u00a06281, pp. 616\u2013628. Springer, Heidelberg (2010)"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Schwichtenberg, H., Wainer, S.S.: Proofs and Computation. Perspectives in Logic. Cambridge University Press (2012)","DOI":"10.1017\/CBO9781139031905"},{"issue":"4","key":"2_CR44","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.2307\/2586811","volume":"64","author":"A. Urquhart","year":"1999","unstructured":"Urquhart, A.: The complexity of decision procedures in relevance logic II. J.\u00a0Symb. Log.\u00a064(4), 1774\u20131802 (1999)","journal-title":"J.\u00a0Symb. Log."},{"issue":"5","key":"2_CR45","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1006\/jsco.1994.1059","volume":"18","author":"A. Weiermann","year":"1994","unstructured":"Weiermann, A.: Complexity bounds for some finite forms of Kruskal\u2019s Theorem. J.\u00a0Symb. Comput.\u00a018(5), 463\u2013488 (1994)","journal-title":"J.\u00a0Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T07:08:35Z","timestamp":1688368115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}