Advertisement

FAST: Fast Acceleration of Symbolic Transition Systems

  • Sébastien Bardin
  • Alain Finkel
  • Jérôme Leroux
  • Laure Petrucci
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2725)

Abstract

fast is a tool for the analysis of infinite systems. This paper describes the underlying theory, the architecture choices that have been made in the tool design. The user must provide a model to analyse, the property to check and a computation policy. Several such policies are proposed as a standard in the package, others can be added by the user. fast capabilities are compared with those of other tools. A range of case studies from the literature has been investigated.

Keywords

Integer Variable Forward Search Architecture Choice Presburger Arithmetic Fast Acceleration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [ALV]
  2. [BRA]
  3. [CPN]
  4. [Del]
    Delzanno, G.: Home Page – Giorgio Delzanno, http://www.disi.unige.it/person/DelzannoG/
  5. [FAS]
  6. [FL02]
    Finkel, A., Leroux, J.: How to compose Presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 145–156. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. [HYT]
  8. [LAS]
  9. [MON]
    The MONA project, http://www.brics.dk/mona/
  10. [SMV]
  11. [SPI]
    spin homepage, http://spinroot.com/spin/
  12. [TRE]

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sébastien Bardin
    • 1
  • Alain Finkel
    • 1
  • Jérôme Leroux
    • 1
  • Laure Petrucci
    • 1
  1. 1.LSV, CNRS UMR 8643, ENS de CachanCACHANFRANCE

Personalised recommendations