PT Unknown
AU Fantechi, A
   Gnesi, S
   Mazzanti, F
   Pugliese, R
   Tronci, E
TI A Symbolic Model Checker for ACTL
SE International Workshop on Current Trends in Applied Formal Method (FM-Trends)
PY 1998
BP 228
EP 242
VL 1641
DI 10.1007/3-540-48257-1_14
AB 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).
PI Boppard, Germany
ER