加载中…
2011-03-22
Multiply-Recursive Upper Bounds with Higman's Lemma
Sylvain SchmitzPhilippe Schnoebelen
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本