FAST: Fast Acceleration of Symbolic Transition Systems [chapter]

Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
2003 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-540-45069-6_12 fatcat:bdifwbi7dfcp3epruwo7nzkqxy