skip to main content
10.1145/1755952.1755987acmconferencesArticle/Chapter ViewAbstractPublication PagescpsweekConference Proceedingsconference-collections
research-article

Bayesian statistical model checking with application to Simulink/Stateflow verification

Published:12 April 2010Publication History

ABSTRACT

We address the problem of model checking stochastic systems, i.e.~checking whether a stochastic system satisfies a certain temporal property with a probability greater (or smaller) than a fixed threshold. In particular, we present a novel Statistical Model Checking (SMC) approach based on Bayesian statistics. We show that our approach is feasible for hybrid systems with stochastic transitions, a generalization of Simulink/Stateflow models. Standard approaches to stochastic (discrete) systems require numerical solutions for large optimization problems and quickly become infeasible with larger state spaces. Generalizations of these techniques to hybrid systems with stochastic effects are even more challenging. The SMC approach was pioneered by Younes and Simmons in the discrete and non-Bayesian case. It solves the verification problem by combining randomized sampling of system traces (which is very efficient for Simulink/Stateflow) with hypothesis testing or estimation. We believe SMC is essential for scaling up to large Stateflow/Simulink models. While the answer to the verification problem is not guaranteed to be correct, we prove that Bayesian SMC can make the probability of giving a wrong answer arbitrarily small. The advantage is that answers can usually be obtained much faster than with standard, exhaustive model checking techniques. We apply our Bayesian SMC approach to a representative example of stochastic discrete-time hybrid system models in Stateflow/Simulink: a fuel control system featuring hybrid behavior and fault tolerance. We show that our technique enables faster verification than state-of-the-art statistical techniques, while retaining the same error bounds. We emphasize that Bayesian SMC is by no means restricted to Stateflow/Simulink models: we have in fact successfully applied it to very large stochastic models from Systems Biology.

References

  1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for probabilistic real-time systems. In ICALP, volume 510 of LNCS, pages 115--126, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. Baier, E. M. Clarke, V. Hartonas-Garmhausen, M. Z. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In ICALP, volume 1256 of LNCS, pages 430{440, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Baier, B. R. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Software Eng., 29(6):524{541, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Bechhofer. A note on the limiting relative efficiency of the Wald sequential probability ratio test. J. Amer. Statist. Assoc., 55:660--663, 1960.Google ScholarGoogle ScholarCross RefCross Ref
  5. F. Ciesinski and M. Gro'er. On probabilistic computation tree logic. In Validation of Stochastic Systems, LNCS, 2925, pages 147--188. Springer, 2004.Google ScholarGoogle Scholar
  6. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857--907, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. H. DeGroot. Optimal Statistical Decisions. Wiley, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  8. B. Finkbeiner and H. Sipma. Checking finite traces using alternating automata. In Runtime Verification (RV '01), volume 55(2) of ENTCS, pages 44--60, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  9. R. Grosu and S. Smolka. Monte Carlo Model Checking. In TACAS, volume 3440 of LNCS, pages 271--286, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Asp. Comput., 6(5):512--535, 1994.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T. Herault, R. Lassaigne, F. Magniette, and S. Peyronnet. Approximate probabilistic model checking. In VMCAI, volume 2937 of LNCS, pages 73--84, 2004.Google ScholarGoogle Scholar
  12. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In TACAS, volume 3920 of LNCS, pages 441--444, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H. Jeffreys. Theory of Probability. Clarendon, 1961.Google ScholarGoogle Scholar
  14. S. K. Jha, E. M. Clarke, C. J. Langmead, A. Legay, A. Platzer, and P. Zuliani. A Bayesian approach to Model Checking biological systems. In CMSB, volume 5688 of LNCS, pages 218--234, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. R. Koymans. Specifying real-time properties with metric temporal logic. Real-time Systems, 2(4):255--299, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. Z. Kwiatkowska, G. Norman, and D. Parker. Symmetry reduction for probabilistic model checking. In CAV, volume 4144 of LNCS, pages 234--248, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C. J. Langmead. Generalized queries and Bayesian statistical model checking in dynamic Bayesian networks: Application to personalized medicine. In CSB, pages 201--212, 2009.Google ScholarGoogle Scholar
  18. O. Maler and D. Nickovic. Monitoring temporal properties of continuous signals. In FORMATS, volume 3253 of LNCS, pages 152--166, 2004.Google ScholarGoogle Scholar
  19. A. Pnueli. The temporal logic of programs. In FOCS, pages 46--57. IEEE, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. P. Robert. The Bayesian Choice. Springer, 2001.Google ScholarGoogle Scholar
  21. K. Sen, M. Viswanathan, and G. Agha. Statistical model checking of black-box probabilistic systems. In CAV, volume 3114 of LNCS, pages 202--215, 2004.Google ScholarGoogle Scholar
  22. K. Sen, M. Viswanathan, and G. Agha. On statistical model checking of stochastic systems. In CAV, volume 3576 of LNCS, pages 266--280, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Wald. Sequential tests of statistical hypotheses. Ann. Math. Statist., 16(2):117--186, 1945.Google ScholarGoogle ScholarCross RefCross Ref
  24. H. L. S. Younes, M. Z. Kwiatkowska, G. Norman, and D. Parker. Numerical vs. statistical probabilistic model checking. STTT, 8(3):216--228, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  25. H. L. S. Younes and D. J. Musliner. Probabilistic plan verification through acceptance sampling. In AIPS Workshop on Planning via Model Checking, pages 81--88, 2002.Google ScholarGoogle Scholar
  26. H. L. S. Younes and R. G. Simmons. Statistical probabilistic model checking with a focus on time-bounded properties. Inf. Comput., 204(9):1368--1409, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. P. S. Yu, C. M. Krishna, and Y.-H. Lee. Optimal design and sequential analysis of VLSI testing strategy. IEEE T. Comput., 37(3):339--347, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. P. Zuliani, A. Platzer, and E. M. Clarke. Bayesian statistical model checking with application to Stateflow/Simulink verification. Technical Report CMU-CS-10-100, Computer Science Department, Carnegie Mellon University, 2010.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Bayesian statistical model checking with application to Simulink/Stateflow verification

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              HSCC '10: Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
              April 2010
              308 pages
              ISBN:9781605589558
              DOI:10.1145/1755952

              Copyright © 2010 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 12 April 2010

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article

              Acceptance Rates

              Overall Acceptance Rate153of373submissions,41%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader