Randomization Helps in LTL Model Checking

Logo poskytovatele
Logo poskytovatele

Varování

Publikace nespadá pod Ekonomicko-správní fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

BRIM Luboš ČERNÁ Ivana NEČESAL Martin

Rok publikování 2001
Druh Článek ve sborníku
Konference Process Algebra and Probabilistic Methods. Proceedings of PAPM-PROBMIV 2001
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
Obor Teorie informace
Klíčová slova Model checking; randomized algorithm; depth-first search
Popis We present and analyze a new probabilistic method for automata based LTL model checking of non-proba\-bi\-listic systems with intention to reduce memory requirements. The main idea of our approach is to use randomness to decide which of the needed information (visited states) should be stored during a computation and which could be omitted. We propose two strategies of probabilistic storing of states. The algorithm never errs, i.e. it always delivers correct results. On the other hand the computation time can increase. The method has been embedded into the SPIN model checker and a series of experiments has been performed. The results confirm that randomization can help to increase the applicability of model checkers in practice.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.