Probabilistic Verification and Approximation

Richard Lassaigne, Sylvain Peyronnet
<span title="">2006</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
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
more &raquo; ... 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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/j.entcs.2005.05.031</a> <a target="_blank" rel="external noopener" href="">fatcat:usjmmp4kjzdrnoztoxpskrguka</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> </button> </a>