The complexity of probabilistic verification
Journal of the ACM (JACM)
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Numerical vs. statistical probabilistic model checking
International Journal on Software Tools for Technology Transfer (STTT)
A formal analysis of bluetooth device discovery
International Journal on Software Tools for Technology Transfer (STTT)
Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
Analysis of probabilistic contract signing
Journal of Computer Security
Using probabilistic model checking in systems biology
ACM SIGMETRICS Performance Evaluation Review
Improved probabilistic models for 802.11 protocol verification
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
On statistical model checking of stochastic systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A bounded statistical approach for model checking of unbounded until properties
Proceedings of the IEEE/ACM international conference on Automated software engineering
Statistical verification of probabilistic properties with unbounded until
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Automated reliability estimation over partial systematic explorations
Proceedings of the 2013 International Conference on Software Engineering
| Hi-index | 0.00 |
We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate methods have been proposed primarily to deal with state-space explosion that makes the exact model checking by numerical methods practically infeasible for large systems. However, the existing statistical methods either consider a restricted subset of PCTL , specifically, the subset that can only express bounded until properties; or rely on user-specified finite bound on the sample path length. We propose a new method that does not have such restrictions and can be effectively used to reason about unbounded until properties. We approximate probabilistic characteristics of an unbounded until property by that of a bounded until property for a suitably chosen value of the bound. In essence, our method is a two-phase process: (a) the first phase is concerned with identifying the bound k 0 ; (b) the second phase computes the probability of satisfying the k 0 -bounded until property as an estimate for the probability of satisfying the corresponding unbounded until property. In both phases, it is sufficient to verify bounded until properties which can be effectively done using existing statistical techniques. We prove the correctness of our technique and present its prototype implementations. We empirically show the practical applicability of our method by considering different case studies including a simple infinite-state model, and large finite-state models such as IPv4 zeroconf protocol and dining philosopher protocol modeled as Discrete Time Markov chains.