Abstract
FAST is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, FAST implements several innovative techniques such as acceleration and circuit selection to solve this problem in practice. In its latest version, the tool is built upon an open architecture: the Presburger library is manipulated through a clear and convenient interface, thus any Presburger arithmetics package can be plugged to the tool. We provide four implementations of the interface using LASH, MONA, OMEGA and a new shared automata package with computation cache. Finally new features are available, like different acceleration algorithms. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Bardin, S., Leroux, J., & Point, G. (2006). FAST extended release. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4144 LNCS, pp. 63–66). Springer Verlag. https://doi.org/10.1007/11817963_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
