{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:08:42Z","timestamp":1725516522763},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326202"},{"type":"electronic","value":"9783642326219"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32621-9_9","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T10:40:40Z","timestamp":1345286440000},"page":"110-126","source":"Crossref","is-referenced-by-count":3,"title":["Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Abriola","sequence":"first","affiliation":[]},{"given":"Santiago","family":"Figueira","sequence":"additional","affiliation":[]},{"given":"Gabriel","family":"Senno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Abriola, S.A.: Sobre la longitud de las secuencias malas controladas en cuasi-\u00f3rdenes buenos. MSc thesis, Universidad de Buenos Aires, Argentina (2011)"},{"key":"9_CR2","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. Theoretical Computer Science\u00a043, 99\u2013105 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"9_CR3","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Communications of the ACM\u00a022(8), 465\u2013476 (1979)","journal-title":"Communications of the ACM"},{"key":"9_CR4","unstructured":"Figueira, D.: Reasoning on Words and Trees with Data. PhD thesis, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France (December 2010)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s lemma. In: LICS, pp. 269\u2013278 (2011)","DOI":"10.1109\/LICS.2011.39"},{"issue":"1-2","key":"9_CR6","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":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/11874683_24","volume-title":"Computer Science Logic","author":"W. Harwood","year":"2006","unstructured":"Harwood, W., Moller, F., Setzer, A.: Weak Bisimulation Approximants. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 365\u2013379. Springer, Heidelberg (2006)"},{"issue":"5-6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00149-0","volume":"72","author":"P. Jancar","year":"1999","unstructured":"Jancar, P.: A note on well quasi-orderings for powersets. Information Processing Letters\u00a072(5-6), 155\u2013160 (1999)","journal-title":"Information Processing Letters"},{"issue":"3","key":"9_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1929954.1929956","volume":"12","author":"M. Jurdzi\u0144ski","year":"2011","unstructured":"Jurdzi\u0144ski, M., Lazi\u0107, R.: Alternating automata on data trees and XPath satisfiability. ACM Transactions on Computational Logic (TOCL)\u00a012(3), 19 (2011)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01967649","volume":"13","author":"M.H. L\u00f6b","year":"1970","unstructured":"L\u00f6b, M.H., Wainer, S.S.: Hierarchies of number theoretic functions, I. Archive for Mathematical Logic\u00a013, 39\u201351 (1970)","journal-title":"Archive for Mathematical Logic"},{"issue":"1-2","key":"9_CR11","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. Theoretical Computer Science\u00a032(1-2), 173\u2013183 (1984)","journal-title":"Theoretical Computer Science"},{"key":"9_CR12","unstructured":"P\u00e9ter, R.: Recursive functions. Academic Press (1967)"},{"key":"9_CR13","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)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32621-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T03:17:36Z","timestamp":1557199056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32621-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326202","9783642326219"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32621-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}