Abstract
Well quasi-orders (wqo’s) are an important mathematical tool for proving termination of many algorithms. Under some assumptions upper bounds for the computational complexity of such algorithms can be extracted by analyzing the length of controlled bad sequences.
We develop a new, self-contained study of the length of bad sequences over the product ordering of ℕn, which leads to known results but with a much simpler argument.
We also give a new tight upper bound for the length of the longest controlled descending sequence of multisets of ℕn, and use it to give an upper bound for the length of controlled bad sequences in the majoring ordering of sets of tuples. We apply this upper bound to obtain complexity upper bounds for decision procedures of automata over data trees.
In both cases the idea is to linearize bad sequences, i.e. transform them into a descending one over a well-order for which upper bounds can be more easily handled.
Keywords
- Decision Procedure
- Recursive Function
- Lexicographic Order
- Termination Proof
- Proper Norm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abriola, S.A.: Sobre la longitud de las secuencias malas controladas en cuasi-órdenes buenos. MSc thesis, Universidad de Buenos Aires, Argentina (2011)
Clote, P.: On the finite containment problem for Petri nets. Theoretical Computer Science 43, 99–105 (1986)
Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Communications of the ACM 22(8), 465–476 (1979)
Figueira, D.: Reasoning on Words and Trees with Data. PhD thesis, Laboratoire Spécification et Vérification, ENS Cachan, France (December 2010)
Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson’s lemma. In: LICS, pp. 269–278 (2011)
Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere? Theoretical Computer Science 256(1-2), 63–92 (2001)
Harwood, W., Moller, F., Setzer, A.: Weak Bisimulation Approximants. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 365–379. Springer, Heidelberg (2006)
Jancar, P.: A note on well quasi-orderings for powersets. Information Processing Letters 72(5-6), 155–160 (1999)
Jurdziński, M., Lazić, R.: Alternating automata on data trees and XPath satisfiability. ACM Transactions on Computational Logic (TOCL) 12(3), 19 (2011)
Löb, M.H., Wainer, S.S.: Hierarchies of number theoretic functions, I. Archive for Mathematical Logic 13, 39–51 (1970)
McAloon, K.: Petri nets and large finite sets. Theoretical Computer Science 32(1-2), 173–183 (1984)
Péter, R.: Recursive functions. Academic Press (1967)
Schmitz, S., Schnoebelen, P.: Multiply-Recursive Upper Bounds with Higman’s Lemma. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 441–452. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abriola, S., Figueira, S., Senno, G. (2012). Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders. In: Ong, L., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2012. Lecture Notes in Computer Science, vol 7456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32621-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-32621-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32620-2
Online ISBN: 978-3-642-32621-9
eBook Packages: Computer ScienceComputer Science (R0)
