BRIM, Luboš, Ivana ČERNÁ and Martin NEČESAL. Randomization Helps in LTL Model Checking. In Process Algebra and Probabilistic Methods. Proceedings of PAPM-PROBMIV 2001. Berlin Heidelberg New York: Springer, 2001, p. 105-119. LNCS 2165. ISBN 3-540-42556-X.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Randomization Helps in LTL Model Checking
Authors BRIM, Luboš, Ivana ČERNÁ and Martin NEČESAL.
Edition Berlin Heidelberg New York, Process Algebra and Probabilistic Methods. Proceedings of PAPM-PROBMIV 2001, p. 105-119, LNCS 2165, 2001.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10000 1. Natural Sciences
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
RIV identification code RIV/00216224:14330/01:00004526
Organization unit Faculty of Informatics
ISBN 3-540-42556-X
Keywords in English Model checking; randomized algorithm; depth-first search
Tags depth-first search, Model checking, randomized algorithm
Changed by Changed by: prof. RNDr. Ivana Černá, CSc., učo 1419. Changed: 31/10/2001 08:01.
Abstract
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.
Links
GA201/00/0400, research and development projectName: Nekonečně stavové souběžné systémy - modely a verifikace
Investor: Czech Science Foundation, Infinite state concurrent systems - models and verification
GA201/00/1023, research and development projectName: Algoritmy a nástroje pro praktickou verifikaci souběžných systémů
Investor: Czech Science Foundation, Algorithms and tools for practical verification of concurrent systems.
MSM 143300001, plan (intention)Name: Nesekvenční modely výpočtů - kvantové a souběžné distribuované modely výpočetních procesů
Investor: Ministry of Education, Youth and Sports of the CR, Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing
PrintDisplayed: 7/5/2024 18:57