BARNAT, Jiří, Luboš BRIM, Ivana ČERNÁ, Milan ČEŠKA and Jana TŮMOVÁ. Local Quantitative LTL Model Checking. In 13th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2008). L'Aquilla: ERCIM, 2008, p. 63-78. ISBN 978-3-642-03239-4.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Local Quantitative LTL Model Checking
Name in Czech Lokální kvantitafivní ověřování modelů LTL
Authors BARNAT, Jiří, Luboš BRIM, Ivana ČERNÁ, Milan ČEŠKA and Jana TŮMOVÁ.
Edition L'Aquilla, 13th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2008), p. 63-78, 16 pp. 2008.
Publisher ERCIM
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Italy
Confidentiality degree is not subject to a state or trade secret
Organization unit Faculty of Informatics
ISBN 978-3-642-03239-4
UT WoS 000270704100004
Keywords in English LTL Model Checking; Probabilistic; Parallel
Tags LTL model checking, parallel, probabilistic
Tags International impact, Reviewed
Changed by Changed by: prof. RNDr. Jiří Barnat, Ph.D., učo 3496. Changed: 29/4/2011 08:46.
Abstract
Quantitative analysis of probabilistic systems has been studied mainly from the global model checking point of view. In the global model-checking, the goal of verification is to decide the probability of satisfaction of a given property for all reachable states in the state space of the system under investigation. On the other hand, in local model checking approach the probability of satisfaction is computed only for the set of initial states. In theory, it is possible to solve the local model checking problem using the global model checking approach. However, the global model checking procedure can be significantly outperformed by a dedicated local model checking one. In this paper we resent several particular local model checking techniques that if applied to global model checking procedure reduce the runtime needed from days to minutes.
Abstract (in Czech)
Kvantitativní analýza pravděpodobnostních systémů byla dosud studována zejména v kontextu globálních algoritmů pro model-checking. V tomto článku je popsán postup, jakým lze proceduru kvantitativní analýzy pravděpodobnostních systémů zdokonalit v případě, že se zajímáme o výsledek analýzy pouze pro iniciální stav systému. Experimentálně bylo ukázáno, že použitím nových metod dochází k redukci časové náročnosti procedury verifikace z řádu dnů na řády minut.
Links
GA201/06/1338, research and development projectName: Automatizovaná verifikace softwaru
Investor: Czech Science Foundation, Automated software verification
1ET408050503, research and development projectName: Techniky automatické verifikace a validace softwarových a hardwarových systémů
Investor: Academy of Sciences of the Czech Republic, Techniques for automatic verification and validation of software nad hardware systems
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science
PrintDisplayed: 30/4/2024 19:43