TY  - CONF
AU  - Fantechi, Alessandro
AU  - Gnesi, Stefania
AU  - Mazzanti, Franco
AU  - Pugliese, Rosario
AU  - Tronci, Enrico
ED  - Hutter, D.
ED  - Stephan, W.
ED  - Traverso, P.
ED  - Ullmann, M.
PY  - 1998
DA  - 1998//
TI  - A Symbolic Model Checker for ACTL
BT  - International Workshop on Current Trends in Applied Formal Method (FM-Trends)
T3  - Lecture Notes in Computer Science
SP  - 228
EP  - 242
VL  - 1641
PB  - Springer
CY  - Boppard, Germany
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).
SN  - 3-540-66462-9
L1  - http://mclab.di.uniroma1.it/publications/papers/papers/Fantechi1998.pdf
UR  - https://doi.org/10.1007/3-540-48257-1_14
DO  - 10.1007/3-540-48257-1_14
N1  - exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=51), last updated on Thu, 22 Nov 2012 14:59:18 +0100
ID  - Fantechi_etal1998
ER  -