Skip to main content

Deductive Controller Synthesis for Probabilistic Hyperproperties

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

Abstract

Probabilistic hyperproperties specify quantitative relations between the probabilities of reaching different target sets of states from different initial sets of states. This class of behavioral properties is suitable for capturing important security, privacy, and system-level requirements. We propose a new approach to solve the controller synthesis problem for Markov decision processes (MDPs) and probabilistic hyperproperties. Our specification language builds on top of the logic HyperPCTL and enhances it with structural constraints over the synthesized controllers. Our approach starts from a family of controllers represented symbolically and defined over the same copy of an MDP. We then introduce an abstraction refinement strategy that can relate multiple computation trees and that we employ to prune the search space deductively. The experimental evaluation demonstrates that the proposed approach considerably outperforms HyperProb, a state-of-the-art SMT-based model checking tool for HyperPCTL. Moreover, our approach is the first one that is able to effectively combine probabilistic hyperproperties with additional intra-controller constraints (e.g. partial observability) as well as inter-controller constraints (e.g. agreements on a common action).

This work has been supported by the Czech Science Foundation grant GA23-06963S (VESCAA), the Czech Ministry of Education, Youth and Sports project LL1908 of the ERC.CZ programme, the Vienna Science and Technology Fund 10.47379/ICT19018, and by the European Union’s ERC CoG ARTIST 101002685 grant and the Horizon 2020 research and innovation programme under grant no. 101034440 .

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

Notes

  1. 1.

    A verification problem defined using universal quantification can be treated as synthesis of a counterexample. Alternation in the controller quantification is not supported as it principally complicates the inductive synthesis strategy. To the best of our knowledge, only very few techniques so far practically support alternation [13, 30].

  2. 2.

    An extension to nested-free PCTL path formulae is straightforward. Principally, we can extend the probability constraints to allow more complicated expressions (e.g. sum/difference of reachability probabilities from different states) eventually requiring reasoning about more than two computation trees.

  3. 3.

    Case (5), when \(\sigma \) is consistent but incompatible with another controller \(\sigma '\), is handled analogously, as well as when they are inter-controller inconsistent.

References

  1. Ábrahám, E., Bartocci, E., Bonakdarpour, B., Dobe, O.: Parameter synthesis for probabilistic hyperproperties. In: LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EPiC Series in Computing, vol. 73, pp. 12–31. EasyChair (2020). https://doi.org/10.29007/37lf

  2. Ábrahám, E., Bartocci, E., Bonakdarpour, B., Dobe, O.: Probabilistic hyperproperties with nondeterminism. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 518–534. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-59152-6_29

    Chapter  Google Scholar 

  3. Ábrahám, E., Bonakdarpour, B.: HyperPCTL: a temporal logic for probabilistic hyperproperties. In: McIver, A., Horvath, A. (eds.) QEST 2018. LNCS, vol. 11024, pp. 20–35. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99154-2_2

    Chapter  Google Scholar 

  4. Andriushchenko, R., Bartocci, E., Ceska, M., Pontiggia, F., Sallinger, S.: Deductive controller synthesis for probabilistic hyperproperties. arXiv preprint arXiv:2307.04503 (2023)

  5. Andriushchenko, R., Češka, M., Junges, S., Katoen, J.-P.: Inductive synthesis for probabilistic programs reaches new horizons. In: TACAS 2021. LNCS, vol. 12651, pp. 191–209. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-72016-2_11

    Chapter  MATH  Google Scholar 

  6. Andriushchenko, R., Ceska, M., Junges, S., Katoen, J.: Inductive synthesis of finite-state controllers for POMDPs. In: Proceedings of UAI 2022: the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence. Proceedings of Machine Learning Research, vol. 180, pp. 85–95. PMLR (2022)

    Google Scholar 

  7. Andriushchenko, R., Češka, M., Junges, S., Katoen, J.-P., Stupinský, Š: PAYNT: a tool for inductive synthesis of probabilistic programs. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 856–869. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-81685-8_40

    Chapter  Google Scholar 

  8. Baier, C., de Alfaro, L., Forejt, V., Kwiatkowska, M.: Model Checking Probabilistic Systems. In: Clarke, E., Henzinger, T., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 963–999. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-10575-8_28

    Chapter  MATH  Google Scholar 

  9. Baier, C., Funke, F., Piribauer, J., Ziemek, R.: On probability-raising causality in Markov decision processes. In: Bouyer, P., Schröder, L. (eds.) FoSSaCS 2022. LNCS, vol. 13242, pp. 40–60. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-99253-8_3

    Chapter  Google Scholar 

  10. Baier, C., Größer, M., Leucker, M., Bollig, B., Ciesinski, F.: Controller synthesis for probabilistic systems (extended abstract). In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IIFIP, vol. 155, pp. 493–506. Springer, Boston, MA (2004). https://doi.org/10.1007/1-4020-8141-3_38

    Chapter  Google Scholar 

  11. Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)

    MATH  Google Scholar 

  12. Barthe, G., Hsu, J.: Probabilistic Couplings from Program Logics, pp. 145–184. Cambridge University Press, Cambridge (2020). https://doi.org/10.1017/9781108770750.006

  13. Beutner, R., Finkbeiner, B.: Software verification of hyperproperties beyond k-safety. In: Shoham, S., Vizel, Y. (eds.) CAV 2022. LNCS, vol. 13371, pp. 341–362. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-13185-1_17

    Chapter  Google Scholar 

  14. Bonakdarpour, B., Finkbeiner, B.: Controller synthesis for hyperproperties. In: 33rd IEEE Computer Security Foundations Symposium, pp. 366–379. IEEE (2020). https://doi.org/10.1109/CSF49147.2020.00033

  15. Češka, M., Jansen, N., Junges, S., Katoen, J.-P.: Shepherding hordes of Markov chains. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 172–190. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-17465-1_10

    Chapter  Google Scholar 

  16. Clarkson, M.R., Finkbeiner, B., Koleini, M., Micinski, K.K., Rabe, M.N., Sánchez, C.: Temporal logics for hyperproperties. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 265–284. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54792-8_15

    Chapter  Google Scholar 

  17. Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157–1210 (2010). https://doi.org/10.3233/JCS-2009-0393

    Article  Google Scholar 

  18. Dimitrova, R., Finkbeiner, B., Torfah, H.: Probabilistic hyperproperties of Markov decision processes. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 484–500. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-59152-6_27

    Chapter  Google Scholar 

  19. Dobe, O., Ábrahám, E., Bartocci, E., Bonakdarpour, B.: HyperProb: a model checker for probabilistic hyperproperties. In: Huisman, M., Păsăreanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 657–666. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-90870-6_35

    Chapter  Google Scholar 

  20. Dobe, O., Wilke, L., Ábrahám, E., Bartocci, E.: Probabilistic hyperproperties with rewards. In: Deshmukh, J.V., Havelund, K., Perez, I. (eds.) NFM 2022. LNCS, vol. 8837, pp. 146–162. Springer, Cham (2014). https://doi.org/10.1007/978-3-031-06773-0_35

    Chapter  Google Scholar 

  21. Dobe, O., Ábrahám, E., Bartocci, E., Bonakdarpour, B.: Model checking hyperproperties for Markov decision processes. Inf. Comput. 289, 104978 (2022). https://doi.org/10.1016/j.ic.2022.104978

    Article  MathSciNet  MATH  Google Scholar 

  22. Dräger, K., Forejt, V., Kwiatkowska, M., Parker, D., Ujma, M.: Permissive controller synthesis for probabilistic systems. In: Ábrahám, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 531–546. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54862-8_44

    Chapter  MATH  Google Scholar 

  23. Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1–12. Springer, Heidelberg (2006). https://doi.org/10.1007/11787006_1

    Chapter  Google Scholar 

  24. Finkbeiner, B., Hahn, C., Lukert, P., Stenger, M., Tentrup, L.: Synthesizing reactive systems from hyperproperties. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 289–306. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96145-3_16

    Chapter  Google Scholar 

  25. Finkbeiner, B., Hahn, C., Lukert, P., Stenger, M., Tentrup, L.: Synthesis from hyperproperties. Acta Informatica 57(1-2), 137–163 (2020). https://doi.org/10.1007/s00236-019-00358-2

  26. Goguen, J.A., Meseguer, J.: Security policies and security models. In: IEEE Symposium on Security and Privacy, pp. 11–20. IEEE Computer Society (1982)

    Google Scholar 

  27. Gray, J.W., Syverson, P.F.: A logical approach to multilevel security of probabilistic systems. Distrib. Comput. 11(2), 73–90 (1998). https://doi.org/10.1007/s004460050043

    Article  MATH  Google Scholar 

  28. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects Comput. 6(5), 512–535 (1994). https://doi.org/10.1007/BF01211866

    Article  MATH  Google Scholar 

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

  30. Hsu, T., Bonakdarpour, B., Kang, E., Tripakis, S.: Mapping synthesis for hyperproperties. In: 35th IEEE Computer Security Foundations Symposium, CSF 2022, Haifa, Israel, 7–10 August 2022, pp. 486–500. IEEE (2022). https://doi.org/10.1109/CSF54842.2022.9919679

  31. Jansen, N., Könighofer, B., Junges, S., Serban, A., Bloem, R.: Safe reinforcement learning using probabilistic shields (invited paper). In: Proceedings of CONCUR 2020: International Conference on Concurrency Theory. Leibniz International Proceedings in Informatics (LIPIcs), vol. 171, pp. 1–16 (2020). https://doi.org/10.4230/LIPIcs.CONCUR.2020.3

  32. Köpf, B., Basin, D.A.: An information-theoretic model for adaptive side-channel attacks. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security (CCS), pp. 286–296. ACM (2007). https://doi.org/10.1145/1315245.1315282

  33. 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 

  34. Norman, G., Parker, D., Zou, X.: Verification and control of partially observable probabilistic real-time systems. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 240–255. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22975-1_16

    Chapter  MATH  Google Scholar 

  35. O’Neill, K.R., Clarkson, M.R., Chong, S.: Information-flow security for interactive programs. In: Proceedings of CSFW: the 19th IEEE Computer Security Foundations Workshop, pp. 190–201. IEEE Computer Society (2006). https://doi.org/10.1109/CSFW.2006.16

  36. Wang, Y., Nalluri, S., Pajic, M.: Hyperproperties for robotics: planning via hyperLTL. In: Proceedings of ICRA: the 2020 IEEE International Conference on Robotics and Automation, pp. 8462–8468. IEEE (2020). https://doi.org/10.1109/ICRA40945.2020.9196874

  37. Zaman, E., Ciardo, G., Ábrahám, E., Bonakdarpour, B.: HyperPCTL model checking by probabilistic decomposition. In: ter Beek, M.H., Monahan, R. (eds.) IFM 2022. LNCS, vol. 13274, pp. 209–226. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-07727-2_12

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Milan Češka or Francesco Pontiggia .

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

Andriushchenko, R., Bartocci, E., Češka, M., Pontiggia, F., Sallinger, S. (2023). Deductive Controller Synthesis for Probabilistic Hyperproperties. 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_20

Download citation

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

  • 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