Approximate Verification of Probabilistic Systems [chapter]

Richard Lassaigne, Sylvain Peyronnet
<span title="">2002</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
General methods have been proposed [2, 4] for the model checking of probabilistic systems, where the verification of a probabilistic statement is reduced to the solution of a linear system over the system's state space. To overcome the state space explosion problem, some probabilistic model checkers, such as PRISM [3], use MTBDDs. We propose a different solution, in which we use a Monte-Carlo algorithm [6] to approximate È ÖÓ ℄, the probability that a temporal formula is true. We show how to
more &raquo; ... ain a randomized estimator of È ÖÓ ℄ for a fragment of LTL formulas. This fragment is sufficient to express interesting properties such as reachability and liveness. We consider a subset of LTL formulas which have the property: truth at depth implies truth in the entire model. The essentially positive fragment (EPF) of LTL is the set of formulas constructed from atomic formulas, their negations, closed under , and the temporal operators Í. If is any formula of the EPF fragment, we can use a BMC-like framework [1] to verify whether is true on a path of depth . The monotonicity of the property defined by an EPF formula yields the following result: for any formula of the essentially positive fragment of LTL and ¼ ½, there exists such that if È ÖÓ ℄ , then È ÖÓ ℄ , where È ÖÓ ℄ is the probability over Kripke paths of depth . We show that we can approximate the probability Ô È ÖÓ ℄ with a simple randomized algorithm. We generate random paths in the probabilistic space underlying the Kripke structure of depth and compute the number of paths on which the given formula is true. In order to approximate Ô with approximation ratio and confidence ratio AE, we use a sample of size AE Ç´½ ¡ ½ ¾ ¡ÐÓ ½ AE µ. To verify a statement È ÖÓ ℄ , we test whether´ AE µ ¡´½ µ. Then if È ÖÓ ℄ , the probability that the algorithm accepts is greater than´½ AEµ, where the probability is taken over the random choices of the algorithm. The lower bound is obtained by using Chernoff bound [7] on the tail of the distribution of a sum of independent random variables. Our method proceeds in two steps: first we determine a lower bound for Ô by binary search and successive applications of the algorithm described above, then we decide the property È ÖÓ ℄ by applying the algorithm once more. The method provides a framework for verifying probabilistic statements for EPF formulas. To approximately verify that È ÖÓ ℄ , where is an EPF formula, we check whether È ÖÓ ℄ , for increasing values of . If È ÖÓ ℄ is true then the monotonicity property guarantees that È ÖÓ ℄ . Otherwise, we increment the value of within a certain bound, for example the diameter of the system for reachability formulas, to conclude that È ÖÓ ℄ . We compare the performance of our method to PRISM's. The results indicate that large systems can be approximately verified in seconds, using very little memory. Ex-
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1007/3-540-45605-8_16</a> <a target="_blank" rel="external noopener" href="">fatcat:ww7jonkecfbhtonqbtdude2di4</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="external alternate icon"></i> </button> </a>