@InProceedings{Fantechi_etal1998,
author="Fantechi, Alessandro
and Gnesi, Stefania
and Mazzanti, Franco
and Pugliese, Rosario
and Tronci, Enrico",
editor="Hutter, D.
and Stephan, W.
and Traverso, P.
and Ullmann, M.",
title="A Symbolic Model Checker for ACTL",
booktitle="International Workshop on Current Trends in Applied Formal Method (FM-Trends)",
series="Lecture Notes in Computer Science",
year="1998",
publisher="Springer",
address="Boppard, Germany",
volume="1641",
pages="228--242",
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).",
optnote="exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=51), last updated on Thu, 22 Nov 2012 14:59:18 +0100",
issn="3-540-66462-9",
doi="10.1007/3-540-48257-1_14",
opturl="https://doi.org/10.1007/3-540-48257-1_14",
file=":http://mclab.di.uniroma1.it/publications/papers/papers/Fantechi1998.pdf:PDF"
}