A Progress Measure for Explicit-State Probabilistic Model-Checkers
Verification of the source code of a probabilistic system by means of an explicit-state model-checker is challenging. In most cases, the probabilistic model-checker will run out of memory due to the infamous state space explosion problem. As far as we know, we are the first to introduce the notion of a progress measure for such a model-checker. The progress measure returns a number in the interval [0, 1]. This number captures the amount of progress the model-checker has made towards verifying a particular linear-time property. The larger the number, the more progress the model-checker has made. We prove that the progress measure provides a lower bound of the measure of the set of execution paths that satisfy the property. We also show how to compute the progress measure for checking a particular class of linear-time properties, namely invariants.
Keywordsprobabilistic model-checking progress measure linear-time property invariant
Unable to display preview. Download preview PDF.
- 6.Pavese, E., Braberman, V., Uchitel, S.: My model checker died!: how well did it do? In: Proceedings of the 2010 ICSE Workshop on Quantitative Stochastic Models in the Verification and Design of Software Systems, pp. 33–40. ACM, New York (2010)Google Scholar
- 8.Vardi, M.Y.: Automatic verification of probabilistic finite-state programs. In: Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pp. 327–338. IEEE, Los Alamitos (1985)Google Scholar
- 10.Zhang, X.: Measuring Progress of Model Checking Randomized Algorithms. Master’s thesis. York University, Toronto (2010)Google Scholar
- 11.Zhang, X., Breugel, F.v.: Measuring progress of Java PathFinder model-checking randomized sequential code. In: Preliminary Proceedings of the 6th Workshop on Quantitative Aspects of Programming Languages, 4 pages (2008)Google Scholar