Bounded Model Checking for Probabilistic Computation Tree Logic

Abstract

In order to overcome the state explosion problem in model checking the probabilistic computation tree logic,a bounded model checking technique is proposed.First,the bounded semantics of the probabilistic computation tree logic is presented,and then its correctness is proved.Second,by a simple instance the criterion of the traditional termination,based on the length of path,is shown to fail.Based on the termination criterion used in the Newton iteration in numerical computing,a new criterion is given.Third,the bounded model checking procedure of the probabilistic computation tree logic is transformed into linear equations.Finally,three benchmarks are used to present the advantages of the bounded model checking.