Degree Type

Thesis

Date of Award

2011

Degree Name

Master of Science

Department

Computer Science

First Advisor

Samik Basu

Second Advisor

Arka P. Ghosh

Abstract

We have developed a new approximate probabilistic model checking method for untimed properties in probabilistic systems, expressed in a probabilistic temporal logic. In contrast to existing methods, this method does not require the untimed until properties to be bounded, where the bound refers to the number of discrete steps in the system required to verify the until property. The method consists of two phases. In the first phase, a suitable system- and property-dependent bound is obtained automatically. In the second phase, the probability of satisfying the bounded until property is computed as the estimate of the probability of satisfying the original unbounded until property. Both phases require only verification of bounded until properties, which can be effectively performed by existing simulation-based methods. We prove the correctness of the proposed two-phase method and present its optimized implementation in the widely used PRISM model checking engine. We compare this implementation with other sampling-based model checking techniques and show that for several models these existing tools fail to compute the result, while the two-phase method successfully computes the result efficiently with respect to time and space.

Copyright Owner

Paul Jennings

Language

en

Date Available

2012-04-30

File Format

application/pdf

File Size

82 pages

Share

COinS