A Symbolic Model Checker for ACTL

 Alessandro Fantechi1,2, Stefania Gnesi2, Franco Mazzanti2, Rosario Pugliese1, Enrico Tronci3
1 Dipartimento di Sistemi e Informatica, Universita' di Firenze
2 Istituto di Elaborazione dell'Informazione, C.N.R. Pisa
3 Dip. di Matematica Applicata, Univ. dell'Aquila

Abstract

We present SAM, a symbolic model checker for ACTL, the action-based version of CTL. SAM relies on implicit representations of Labeled Transition Systems (LTSs), the semantic domain for ACTL formulae, and uses symbolic manipulation algorithms. SAM has been realized by translating (networks of) LTSs and, possibly recursive, ACTL formulae into BSP (Boolean Symbolic Programming), a programming language aiming at defining computations on boolean functions, and by using the BSP interpreter to carry out computations (i.e. verifications).