Probabilistic verification and approximation
We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems. Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas. We...
Uložené v:
| Vydané v: | Annals of pure and applied logic Ročník 152; číslo 1; s. 122 - 131 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.03.2008
|
| Predmet: | |
| ISSN: | 0168-0072 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems. Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas. We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification. However, in many applications, specifications can be expressed by monotone formulas or negation of monotone formulas and randomized approximation schemes with absolute error are sufficient. We show how some simple randomized approximation algorithms can improve the efficiency of verification of such probabilistic specifications and can be implemented in a probabilistic model checker. |
|---|---|
| ISSN: | 0168-0072 |
| DOI: | 10.1016/j.apal.2007.11.006 |