Multiply-Recursive Upper Bounds with Higman's Lemma

Details Multiply-Recursive Upper Bounds with Higman's Lemma Multiply-Recursive Upper Bounds with Higman's Lemma

2011-03-22

arxiv.org/abs/1103.4399v2

In Aceto, L., Henzinger, M., and Sgall, J., editors, ICALP 2011, 38th International Colloquium on Automata, Languages and Prog

Computer Science

Logic in Computer Science

Scientific paper

10.1007/978-3-642-22012-8_35

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.

Affiliated with

Also associated with

No associations

Rating

Multiply-Recursive Upper Bounds with Higman's Lemma does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiply-Recursive Upper Bounds with Higman's Lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiply-Recursive Upper Bounds with Higman's Lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-440426