Marta Kwiatkowska
David Parker
Skip Abstract Section
Abstract
In this paper, we describe some practical applications of probabilistic model checking, a technique for the formal analysis of systems which exhibit stochastic behaviour. We give an overview of a selection of case studies carried out using the probabilistic model checking tool PRISM, demonstrating the wide range of application domains to which these methods are applicable. We also illustrate several benefits of using formal verification techniques to analyse probabilistic systems, including: (i) that they allow a wide range of numerical properties to be computed accurately; and (ii) that they perform a complete and exhaustive analysis enabling, for example, a study of best- and worst-case scenarios.
- PRISM web site. www.cs.bham.ac.uk/~dxp/prism.]]Google Scholar
- C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering, 29(6):524--541, 2003.]] Google ScholarDigital Library
- M. Duflot, L. Fribourg, T. Hérault, R. Lassaigne, F. Magniette, S. Messika, S. Peyronnet, and C. Picaronny. Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC. In Proc. 4th Workshop on Automated Verification of Critical Systems (AVoCS'04). Elsevier Science, Electronic Notes in Theoretical Computer Science Science, 2004. To appear.]] Google ScholarDigital Library
- M. Duflot, M. Kwiatkowska, G. Norman, and D. Parker. A formal analysis of Bluetooth device discovery. In Proc. 1st International Symposium on Leveraging Applications of Formal Methods (ISOLA'04), 2004. To appear.]]Google Scholar
- S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637--647, 1985.]] Google ScholarDigital Library
- W. Fokkink and J. Pang. Simplifying Itai-Rodeh leader election for anonymous rings. In Proc. 4th Workshop on Automated Verification of Critical Systems (AVoCS'04). Elsevier Science, Electronic Notes in Theoretical Computer Science Science, 2004. To appear.]] Google ScholarDigital Library
- J. Han and P. Jonker. A system architecture solution for unreliable nanoelectronic devices. IEEE Transactions on Nanotechnology, 1:201--208, 12002.]] Google ScholarDigital Library
- T. Herman. Probabilistic self-stabilization. Information Processing Letters, 35(2):63--67, 1990.]] Google ScholarDigital Library
- H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A Markov chain model checker. In S. Graf and M. Schwartzbach, editors, Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1785 of LNCS, pages 347--362. Springer, 2000.]] Google ScholarDigital Library
- B. Jeannet, P. D'Argenio, and K. Larsen. RAPTURE: A tool for verifying Markov decision processes. In I. Cerna, editor, Proc. Tools Day, affiliated to 13th Int. Conf. Concurrency Theory (CONCUR'02), Technical Report FIMU-RS-2002--05, Faculty of Informatics, Masaryk University, pages 84--98, 2002.]]Google Scholar
- M. Kwiatkowska and G. Norman. Verifying randomized Byzantine agreement. In D. Peled and M. Vardi, editors, Proc. Formal Techniques for Networked and Distributed Systems (FORTE'02), volume 2529 of LNCS, pages 194--209. Springer, 2002.]] Google ScholarDigital Library
- M. Kwiatkowska, G. Norman, and D. Parker. PRISM 2.0: A tool for probabilistic model checking. In Proc. 1st International Conference on Quantitative Evaluation of Systems (QEST'04), pages 322--323. IEEE Computer Society Press, 2004.]] Google ScholarDigital Library
- M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston. Performance analysis of probabilistic timed automata using digital clocks. In K. Larsen and P. Niebert, editors, Proc. Formal Modeling and Analysis of Timed Systems (FORMATS'03), volume 2791 of LNCS, pages 105--120. Springer-Verlag, 2003.]]Google Scholar
- M. Kwiatkowska, G. Norman, and R. Segala. Automated verification of a randomized distributed consensus protocol using Cadence SMV and PRISM. In G. Berry, H. Comon, and A. Finkel, editors, Proc. 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of LNCS, pages 194--206. Springer, 2001.]] Google ScholarDigital Library
- M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In H. Hermanns and R. Segala, editors, Proc. 2nd Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'02), volume 2399 of LNCS, pages 169--187. Springer, 2002.]] Google ScholarDigital Library
- M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Special Issue of Formal Aspects of Computing, 14:295--318, 2003.]]Google ScholarCross Ref
- M. Kwiatkowska, G. Norman, J. Sproston and F. Wang. Symbolic model checking for probabilistic timed automata. In Y. Lakhnech and S. Yovine, editors, Joint Conference on Formal Modelling and Analysis of Timed Systems (FORMATS) and Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT), volume 3253 of LNCS, pages 293--308. Springer, 2004.]]Google Scholar
- R. Lanotte, A. Maggiolo-Schettini, and A. Troina. Automatic analysis of a non-repudiation protocol. In Proc. 2nd International Workshop on Quantitative Aspects of Programming Languages (QAPL'04), 2004.]]Google Scholar
- P. Lecca and C. Priami. Cell cycle control in eukaryotes: A BioSpi model. In Proc. Workshop on Concurrent Models in Molecular Biology (BioConcur'03), Electronic Notes in Theoretical Computer Science, 2003.]] Google ScholarDigital Library
- A. McIver and C. Morgan. An elementary proof that Herman's ring is θ(n2). Submitted for publication.]]Google Scholar
- G. Norman, D. Parker, M. Kwiatkowska, and S. Shukla. Evaluating the reliability of NAND multiplexing with PRISM. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2005. To appear.]] Google ScholarDigital Library
- G. Norman, D. Parker, M. Kwiatkowska, S. Shukla, and R. Gupta. Formal analysis and validation of continuous time Markov chain based system level power management strategies. In W. Rosenstiel, editor, Proc. 7th Annual IEEE International Workshop on High Level Design Validation and Test (HLDVT'02), pages 45--50. IEEE Computer Society Press, 2002.]] Google ScholarDigital Library
- G. Norman, D. Parker, M. Kwiatkowska, S. Shukla, and R. Gupta. Using probabilistic model checking for dynamic power management. In M. Leuschel, S. Gruner, and S. L. Presti, editors, Proc. 3rd Workshop on Automated Verification of Critical Systems (AVoCS'03), Technical Report DSSE-TR-2003-2. University of Southampton, pages 202--215, April 2003.]]Google Scholar
- G. Norman and V. Shmatikov. Analysis of probabilistic contract signing. In A. Abdallah, P. Ryan, and S. Schneider, editors, Proc. BCS-FACS Formal Aspects of Security (FASec'02), volume 2629 of LNCS, pages 81--96. Springer, 2003.]]Google Scholar
- G. Norman and V. Shmatikov. Analysis of probabilistic contract signing. Submitted, 2005.]]Google Scholar
- P. Pillai and K. Shin. Real-time dynamic voltage scaling for low-powered embedded operating systems. Operating Systems Review, 35(5):89--102, 2001.]] Google ScholarDigital Library
- J. Rutten, M. Kwiatkowska, G. Norman, and D. Parker. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, P. Panangaden and F. van Breugel (eds.), volume 23 of CRM Monograph Series. American Mathematical Society, 2004.]]Google Scholar
- V. Shmatikov. Probabilistic model checking of an anonymity system. Journal of Computer Security, 12(3/4):355--377, 2004.]] Google ScholarDigital Library
- M. Stoelinga. Alea jacta est: Verification of probabilistic, real-time and parametric systems. PhD thesis, University of Nijmegen, 2002.]]Google Scholar
- J. von Neumann. Probabilistic logics and synthesis of reliable organisms from unreliable components. In C. Shannon and J. McCarthy, editors, Automata Studies, pages 43--98. Princeton University Press, 1956.]]Google ScholarCross Ref
Index Terms
- Probabilistic model checking in practice: case studies with PRISM
Recommendations
Model checking epistemic-probabilistic logic using probabilistic interpreted systems
Model checking is a formal technique widely used to verify security and communication protocols in epistemic multi-agent systems against given properties. Qualitative properties such as safety and liveliness have been widely analyzed in the literature. ...
Model checking hierarchical probabilistic systems
ICFEM'10: Proceedings of the 12th international conference on Formal engineering methods and software engineeringProbabilistic modeling is important for random distributed algorithms, bio-systems or decision processes. Probabilistic model checking is a systematic way of analyzing finite-state probabilistic models. Existing probabilistic model checkers have been ...
A two-phase approximation for model checking probabilistic unbounded until properties of probabilistic systems
We have developed a new approximate probabilistic model-checking method for untimed properties in probabilistic systems, expressed in a probabilistic temporal logic (PCTL, CSL). This method, in contrast to the existing ones, does not require the untimed ...
Comments