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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Bardin, S., Finkel, A., Leroux, J., & Petrucci, L. (2003). FAST: Fast acceleration of symbolic transition systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2725, 118–121. https://doi.org/10.1007/978-3-540-45069-6_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
