 |
PREUVES, PROGRAMMES et SYSTÈMES |  |
|
PREUVES, PROGRAMMES et SYSTÈMES | |
| HAL : hal-00496912, version 1 |
| Fiche détaillée |  Récupérer au format |
 |
| FOSSACS, Bologna : Italie (2010) |
|
|
|
|
| Counterexamples in Probabilistic LTL Model Checking |
|
|
| Matthias Schmalz 1Daniele Varacca 2 |
|
|
| (09/2009) |
|
|
|
| We propose a way of presenting and computing a counterexample in probabilistic LTL model checking for discrete-time Markov chains. In qualitative probabilistic model checking, we present a counterexample as a pair (x,c), where x,c are finite words such that all paths that extend x and have infinitely many occurrences of c violate the specification. In quantitative probabilistic model checking, we present a counterexample as a pair (X,R), where X is a set of such finite words x and R is a set of such finite words c. Moreover, we suggest how the counterexample presented helps the user identify the underlying error in the system by means of an interactive game with the model checker. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Eldgenössische Technische Hochschule Zürich (ETH Zürich) |
|
|
|
ETH Zurich |
|
|
| 2 : | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
| 3 : | IBM Zurich Research Laboratory |
|
|
|
IBM |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Logique en informatique Informatique/Algorithme et structure de données |
|
|
| Fairness – Model Checking – Counterexamples – Linear-Time temporal Logics |
|
| hal-00496912, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00496912 | |
| oai:hal.archives-ouvertes.fr:hal-00496912 | |
| Contributeur : Daniele Varacca | |
| Soumis le : Jeudi 1 Juillet 2010, 17:07:48 | |
| Dernière modification le : Jeudi 1 Juillet 2010, 17:07:48 | |
