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 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.
%0 Conference Paper
%1 conf/cav/BardinFLP03
%A Bardin, Sébastien
%A Finkel, Alain
%A Leroux, Jérôme
%A Petrucci, Laure
%B CAV
%D 2003
%E Jr., Warren A. Hunt
%E Somenzi, Fabio
%I Springer
%K modelchecking petrinetflatness petrinets
%P 118-121
%T FAST: Fast Acceleration of Symbolic Transition Systems.
%U http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FAST-cav03.ps
%V 2725
%X 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 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.
%@ 3-540-40524-0
@inproceedings{conf/cav/BardinFLP03,
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 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.},
added-at = {2020-01-16T11:15:24.000+0100},
author = {Bardin, Sébastien and Finkel, Alain and Leroux, Jérôme and Petrucci, Laure},
biburl = {https://www.bibsonomy.org/bibtex/282cf6d20147e678b6df8548f4da3e77c/paves_intern},
booktitle = {CAV},
crossref = {conf/cav/2003},
editor = {Jr., Warren A. Hunt and Somenzi, Fabio},
ee = {https://doi.org/10.1007/978-3-540-45069-6_12},
interhash = {c7ab4f94c895ddf95c404bf4c6b3b3cf},
intrahash = {82cf6d20147e678b6df8548f4da3e77c},
isbn = {3-540-40524-0},
keywords = {modelchecking petrinetflatness petrinets},
pages = {118-121},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2020-01-16T11:15:24.000+0100},
title = {FAST: Fast Acceleration of Symbolic Transition Systems.},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FAST-cav03.ps},
volume = 2725,
year = 2003
}