FAST: Fast Acceleration of Symbolic Transition Systems

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.

Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints

“…For instance, Petri nets represent the subclass of counter systems obtained by removing the ability to test a counter for zero. Other examples include reversal-bounded counter machines [Iba78], flat counter systems [Boi98,BFLP03,LS04] and constraint automata with qualitative constraints on Z between the states of variables at different steps of the execution [DG05]. "Qualitative" means that the relationship between the constrained variables is not sharp, like x < y.…”

Abstract acceleration in linear relation analysis

“…Aspic takes as input the textual automata input format of the tool Fast ( [7]). A Fast file is composed of two parts:…”

“…A source of inspiration are the so-called "acceleration techniques" proposed by several authors [14,64,23,32,7]. These works consist in identifying categories of loops whose effect can be computed exactly.…”

Towards a Model-Checker for Counter Systems

“…Motivation For practical (computer-aided) model-checking, an infinite-state system must be provided with an effective finitary presentation, and in particular, must admit a symbolic representation of sets of states and transitions. Presburger arithmetic is a particularly appropriate platform for symbolic representation of a wide variety of infinite state systems, such as counter systems (see [BFLP03]) where vectors of integers are subjected to linear transformations from finite control graph. These strongly extend counter automata and even very simple examples of counter systems can have notoriously difficult and unpredictable behaviour, a witness being the Syracuse problem, see e.g.…”

“…An important and natural class of counter systems, in which various practical cases of infinite state systems (e.g. broadcast protocols [FL02]) can be modelled, are those with a flat control graph, i.e, those where no control state occurs in more than one simple cycle (see [Boi98,CJ98,CC00,FL02,BFLP03,Ler03]). Strong results on verifying safety and reachability properties on flat counter systems have been obtained in [CJ98,FL02].…”