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 makes use of 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 de ning computations on boolean functions, and by using the BSP interpreter to carry out computations (i.e. verications).
In REF , Fantechi et al. present SAM, a symbolic model checker based on BSP (Boolean symbolic programming), a programming language aimed at defining computations on boolean functions.
A Symbolic Model Checker for ACTL
FM-Trends
Computer Science