@paves_intern

FAST: Fast Acceleration of Symbolic Transition Systems.

, , , and . CAV, volume 2725 of Lecture Notes in Computer Science, page 118-121. Springer, (2003)

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.

Links and resources

Tags