Abstract
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman's Lemma. This leads to tight multiply-recursive upper bounds that readily apply to several verification algorithms for well-structured systems. © 2011 Springer-Verlag.
Cite
CITATION STYLE
APA
Schmitz, S., & Schnoebelen, P. (2011). Multiply-recursive upper bounds with Higman’s Lemma. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6756 LNCS, pp. 441–452). https://doi.org/10.1007/978-3-642-22012-8_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free