par Darlot, Christophe;Finkel, Alain;Van Begin, Laurent 
Référence Electronic Notes in Theoretical Computer Science, 128, 6, page (87-103)
Publication Publié, 2005-05
Référence Electronic Notes in Theoretical Computer Science, 128, 6, page (87-103)
Publication Publié, 2005-05
Article révisé par les pairs
| Résumé : | Fast and TReX tools are designed to analyse systems with infinite state spaces. They both implement algorithms computing the set of reachable states of such systems. Since the state space may be infinite, acceleration techniques are used. In this paper, we study the differences between Fast and TReX acceleration techniques and show that although Fast remains in Presburger logics while accelerating, TReX can produce 1st order arithmetical formulas even when accelerating functions. © 2005 Elsevier B.V. All rights reserved. |
