Multiply-Recursive Upper Bounds with Higman's Lemma - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Multiply-Recursive Upper Bounds with Higman's Lemma

Résumé

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.

Dates et versions

hal-00609865 , version 1 (20-07-2011)

Identifiants

Citer

Sylvain Schmitz, Philippe Schnoebelen. Multiply-Recursive Upper Bounds with Higman's Lemma. 38th International Colloquium on Automata, Languages and Programming, Jul 2011, Zürich, Switzerland. p. 441--452, ⟨10.1007/978-3-642-22012-8_35⟩. ⟨hal-00609865⟩
50 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More