Skip to main content

STAMINA in C++: Modernizing an Infinite-State Probabilistic Model Checker

  • Conference paper
  • First Online:
Quantitative Evaluation of Systems (QEST 2023)

Abstract

Improving the scalability of probabilistic model checking (PMC) tools is crucial to the verification of real-world system designs. The Stamina infinite-state PMC tool achieves scalability by iteratively constructing a partial state space for an unbounded continuous-time Markov chain model, where a majority of the probability mass resides. It then performs time-bounded transient PMC. It can efficiently produce an accurate probability bound to the property under verification. We present a new software architecture design and the C++ implementation of the Stamina 2.0 algorithm, integrated with the Storm model checker. This open-source Stamina implementation offers a high degree of modularity and provides significant optimizations to the Stamina 2.0 algorithm. Performance improvements are demonstrated on multiple challenging benchmark examples, including hazard analysis of infinite-state combinational genetic circuits, over the previous Stamina implementation. Additionally, its design allows for future customizations and optimizations to the Stamina algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. https://github.com/fluentverification/stamina-storm

  2. https://depend.cs.uni-saarland.de/tools/infamy/casestudies/

  3. Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Software Eng. 29(6), 524–541 (2003). https://doi.org/10.1109/TSE.2003.1205180

    Article  MATH  Google Scholar 

  4. Budde, C.E., et al.: On correctness, precision, and performance in quantitative verification. In: Margaria, T., Steffen, B. (eds.) ISoLA 2020. LNCS, vol. 12479, pp. 216–241. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-83723-5_15

    Chapter  Google Scholar 

  5. Češka, M., Křetínský, J.: Semi-quantitative abstraction and analysis of chemical reaction networks. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 475–496. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25540-4_28

    Chapter  Google Scholar 

  6. Fontanarrosa, P., Doosthosseini, H., Borujeni, A.E., Dorfan, Y., Voigt, C.A., Myers, C.: Genetic circuit dynamics: hazard and glitch analysis. ACS Synth. Biol. 15 (2020)

    Google Scholar 

  7. Fox, B.L., Glynn, P.W.: Computing poisson probabilities. Commun. ACM 31(4), 440–445 (1988). https://doi.org/10.1145/42404.42409

    Article  MathSciNet  Google Scholar 

  8. Hahn, E.M., Hermanns, H., Wachter, B., Zhang, L.: INFAMY: an infinite-state Markov model checker. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 641–647. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02658-4_49

    Chapter  Google Scholar 

  9. Hensel, C., Junges, S., Katoen, J.P., Quatmann, T., Volk, M.: The probabilistic model checker Storm. Int. J. Softw. Tools Technol. Transfer 24(4), 589–610 (2022). https://doi.org/10.1007/s10009-021-00633-z

    Article  Google Scholar 

  10. Hermanns, H., Meyer-Kayser, J., Siegle, M.: Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In: Plateau, B., Stewart, W., Silva, M. (eds.) NSMC, pp. 188–207 (1999)

    Google Scholar 

  11. Jackson, J.: Networks of waiting lines. Oper. Res. 5, 518–521 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kwiatkowsa, M., Norman, G., Parker, D.: The PRISM benchmark suite. In: International Conference on Quantitative Evaluation of Systems (QEST), pp. 203–204 (2012). https://doi.org/10.1109/QEST.2012.14. https://doi.ieeecomputersociety.org/10.1109/QEST.2012.14

  13. Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585–591. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22110-1_47

    Chapter  Google Scholar 

  14. Lapin, M., Mikeev, L., Wolf, V.: Shave: stochastic hybrid analysis of Markov population models. In: Proceedings of the 14th International Conference on Hybrid Systems: Computation and Control, HSCC 2011, pp. 311–312. ACM, New York (2011)

    Google Scholar 

  15. Madsen, C., Zhang, Z., Roehner, N., Winstead, C., Myers, C.: Stochastic model checking of genetic circuits. J. Emerg. Technol. Comput. Syst. 11(3), 23:1–23:21 (2014). https://doi.org/10.1145/2644817. http://doi.acm.org/10.1145/2644817

  16. Neupane, T., Myers, C.J., Madsen, C., Zheng, H., Zhang, Z.: STAMINA: STochastic approximate model-checker for INfinite-state analysis. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 540–549. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25540-4_31

    Chapter  Google Scholar 

  17. Neupane, T., Zhang, Z., Madsen, C., Zheng, H., Myers, C.J.: Approximation techniques for stochastic analysis of biological systems. In: Liò, P., Zuliani, P. (eds.) Automated Reasoning for Systems Biology and Medicine. CB, vol. 30, pp. 327–348. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-17297-8_12

    Chapter  Google Scholar 

  18. Nielsen, A.A.K., et al.: Genetic circuit design automation. Science 352(6281), aac7341 (2016). https://doi.org/10.1126/science.aac7341. https://www.science.org/doi/abs/10.1126/science.aac7341

  19. Roberts, R., Neupane, T., Buecherl, L., Myers, C.J., Zhang, Z.: STAMINA 2.0: improving scalability of infinite-state stochastic model checking. In: Finkbeiner, B., Wies, T. (eds.) VMCAI 2022. LNCS, vol. 13182, pp. 319–331. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-94583-1_16

    Chapter  Google Scholar 

  20. Volk, M., Junges, S., Katoen, J.P.: Fast dynamic fault tree analysis by model checking techniques. IEEE Trans. Ind. Informatics 14(1), 370–379 (2018). https://doi.org/10.1109/TII.2017.2710316

    Article  Google Scholar 

Download references

Acknowledgment

We thank Tim Quatmann at RWTH Aachen University for his help with interfacing the Storm model checker. This work was supported by the National Science Foundation under Grant No. 1856733, 1856740, and 1900542. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the funding agencies.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Joshua Jeppson or Zhen Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jeppson, J. et al. (2023). STAMINA in C++: Modernizing an Infinite-State Probabilistic Model Checker. In: Jansen, N., Tribastone, M. (eds) Quantitative Evaluation of Systems. QEST 2023. Lecture Notes in Computer Science, vol 14287. Springer, Cham. https://doi.org/10.1007/978-3-031-43835-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43835-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43834-9

  • Online ISBN: 978-3-031-43835-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics