Article

Guessing Winning Policies in LTL Synthesis by Semantic Learning

Authors:

Jan Křetínský,

Tobias Meggendorfer,

Maximilian Prokop,

Sabine RiederAuthors Info & Claims

Computer Aided Verification: 35th International Conference, CAV 2023, Paris, France, July 17–22, 2023, Proceedings, Part I

Pages 390 - 414

https://doi.org/10.1007/978-3-031-37706-8_20

Published: 17 July 2023 Publication History

Abstract

We provide a learning-based technique for guessing a winning strategy in a parity game originating from an LTL synthesis problem. A cheaply obtained guess can be useful in several applications. Not only can the guessed strategy be applied as best-effort in cases where the game’s huge size prohibits rigorous approaches, but it can also increase the scalability of rigorous LTL synthesis in several ways. Firstly, checking whether a guessed strategy is winning is easier than constructing one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy iteration faster than constructing one from scratch. Thirdly, the guess can be used in on-the-fly approaches to prioritize exploration in the most fruitful directions.

In contrast to previous works, we (i) reflect the highly structured logical information in game’s states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii) learn to reflect it properly by learning from previously solved games, bringing the solving process closer to human-like reasoning.

References

[1]

Artifact for “Guessing Winning Policies in LTL Synthesis by Semantic Learning”. Zenodo (2023).

[2]

Artifact for “Guessing Winning Policies in LTL Synthesis by Semantic Learning”. Zenodo (2023).

[3]

Bernet J, Janin D, and Walukiewicz I Permissive strategies: from parity games to safety games RAIRO Theor. Inform. Appl. 2002 36 3 261-275

[4]

Calude CS, Jain S, Khoussainov B, Li W, and Stephan F Deciding parity games in quasi-polynomial time SIAM J. Comput. 2022 51 2 17-152

[5]

Cosler, M., Schmitt, F., Hahn, C., Finkbeiner, B.: Iterative circuit repair against formal specifications. arXiv preprint arXiv:2303.01158 (2023)

[6]

Dijk, T.: Oink: an implementation and evaluation of modern parity game solvers. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 291–308. Springer, Cham (2018).

[7]

Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, É., Xu, L.: Spot 2.0 — a framework for LTL and

ω

-automata manipulation. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 122–129. Springer, Cham (2016).

[8]

Esparza, J., Křetínský, J.: From LTL to deterministic automata: a safraless compositional approach. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 192–208. Springer, Cham (2014).

[9]

Esparza, J., Křetínský, J., Raskin, J.-F., Sickert, S.: From LTL and limit-deterministic büchi automata to deterministic parity automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 426–442. Springer, Heidelberg (2017).

[10]

Esparza J, Kretínský J, Raskin J, and Sickert S From linear temporal logic and limit-deterministic büchi automata to deterministic parity automata Int. J. Softw. Tools Technol. Transf. 2022 24 4 635-659

[11]

Esparza, J., Kretínský, J., Sickert, S.: One theorem to rule them all: a unified translation of LTL into

ω

-automata. In: Dawar, A., Grädel, E. (eds.) Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, 09–12 July 2018, pp. 384–393. ACM (2018).

[12]

Esparza J, Kretínský J, and Sickert S A unified translation of linear temporal logic to

ω

-automata J. ACM 2020 67 6 33:1-33:61

[13]

Fearnley, J.: Efficient parallel strategy improvement for parity games. In: Majumdar, R., Kunčak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 137–154. Springer, Cham (2017).

[14]

Fearnley, J., Jain, S., Schewe, S., Stephan, F., Wojtczak, D.: An ordered approach to solving parity games in quasi polynomial time and quasi linear space. In: Erdogmus, H., Havelund, K. (eds.) Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, Santa Barbara, 10–14 July 2017, pp. 112–121. ACM (2017).

[15]

Friedmann, O., Lange, M.: Solving parity games in practice. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 182–196. Springer, Heidelberg (2009).

[16]

Gaiser, A., Křetínský, J., Esparza, J.: Rabinizer: small deterministic automata for LTL(F,G). In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 72–76. Springer, Heidelberg (2012).

[17]

Hoffmann, P., Luttenberger, M.: Solving parity games on the GPU. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 455–459. Springer, Cham (2013).

[18]

Jacobs, S., et al.: The reactive synthesis competition (SYNTCOMP): 2018–2021. arXiv preprint arXiv:2206.00251 (2022)

[19]

Jurdzinski, M.: Deciding the winner in parity games is in UP

\

cap co-up. Inf. Process. Lett. 68(3), 119–124 (1998).

[20]

Komárková, Z., Křetínský, J.: Rabinizer 3: safraless translation of LTL to small deterministic automata. In: Cassez, F., Raskin, J.-F. (eds.) ATVA 2014. LNCS, vol. 8837, pp. 235–241. Springer, Cham (2014).

[21]

Křetínský, J., Garza, R.L.: Rabinizer 2: small Deterministic Automata for LTL/GL. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 446–450. Springer, Cham (2013).

[22]

Křetínský, J., Manta, A., Meggendorfer, T.: Semantic labelling and learning for parity game solving in LTL synthesis. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 404–422. Springer, Cham (2019).

[23]

Kretinsky, J., Meggendorfer, T., Prokop, M., Rieder, S.: Guessing winning policies in LTL synthesis by semantic learning (2023)

[24]

Křetínský, J., Meggendorfer, T., Sickert, S.: Owl: a library for

ω

-words, automata, and LTL. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 543–550. Springer, Cham (2018).

[25]

Křetínský, J., Meggendorfer, T., Sickert, S., Ziegler, C.: Rabinizer 4: from LTL to your favourite deterministic automaton. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 567–577. Springer, Cham (2018).

[26]

Kretínský, J., Meggendorfer, T., Waldmann, C., Weininger, M.: Index appearance record with preorders. Acta Inform. 59(5), 585–618 (2022).

[27]

Kupferman, O., Rosenberg, A.: The blow-up in translating LTL to deterministic automata. In: van der Meyden, R., Smaus, J.-G. (eds.) MoChArt 2010. LNCS (LNAI), vol. 6572, pp. 85–94. Springer, Heidelberg (2011).

[28]

Lehtinen, K., Parys, P., Schewe, S., Wojtczak, D.: A recursive approach to solving parity games in quasipolynomial time. Log. Methods Comput. Sci. 18(1) (2022).

[29]

Li, J., Zhang, L., Pu, G., Vardi, M.Y., He, J.: LTL satisfiability checking revisited. In: Sánchez, C., Venable, K.B., Zimányi, E. (eds.) 2013 20th International Symposium on Temporal Representation and Reasoning, Pensacola, 26–28 September 2013, pp. 91–98. IEEE Computer Society (2013).

[30]

Liu T Learning to rank for information retrieval Found. Trends Inf. Retr. 2009 3 3 225-331

[31]

Luttenberger, M., Meyer, P.J., Sickert, S.: Practical synthesis of reactive systems from LTL specifications via parity games. Acta Inform. 3–36 (2019).

[32]

Meyer, P.J., Luttenberger, M.: Solving mean-payoff games on the GPU. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 262–267. Springer, Cham (2016).

[33]

Meyer, P.J., Sickert, S., Luttenberger, M.: Strix: explicit reactive synthesis strikes back! In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 578–586. Springer, Cham (2018).

[34]

Osborne, M.J.: An introduction to game theory (2004)

[35]

Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825–2830 (2011)

[36]

Piterman, N.: From nondeterministic buchi and streett automata to deterministic parity automata. In: Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12–15 August 2006, Seattle, pp. 255–264. IEEE Computer Society (2006).

[37]

Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October - 1 November 1977, pp. 46–57. IEEE Computer Society (1977).

[38]

Pnueli A and Rosner R Ausiello G, Dezani-Ciancaglini M, and Della Rocca SR On the synthesis of an asynchronous reactive module Automata, Languages and Programming 1989 Heidelberg Springer 652-671

[39]

Safra, S.: On the complexity of omega-automata. In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, 24–26 October 1988, pp. 319–327. IEEE Computer Society (1988).

[40]

Schewe, S.: Tighter bounds for the determinisation of Büchi automata. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 167–181. Springer, Heidelberg (2009).

[41]

Schmitt, F., Hahn, C., Rabe, M.N., Finkbeiner, B.: Neural circuit synthesis from specification patterns. In: Ranzato, M., Beygelzimer, A., Dauphin, Y.N., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, 6–14 December 2021, Virtual, pp. 15408–15420 (2021). https://proceedings.neurips.cc/paper/2021/hash/8230bea7d54bcdf99cdfe85cb07313d5-Abstract.html

[42]

Sickert, S., Esparza, J., Jaax, S., Křetínský, J.: Limit-deterministic Büchi automata for linear temporal logic. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 312–332. Springer, Cham (2016).

[43]

Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings of the Symposium on Logic in Computer Science (LICS 1986), Cambridge, Massachusetts, 16–18 June 1986, pp. 332–344. IEEE Computer Society (1986)

Cited By

Gu RMoezkarimi ZSirjani M(2024)Guess and Then Check: Controller Synthesis for Safe and Secure Cyber-Physical SystemsFormal Techniques for Distributed Objects, Components, and Systems10.1007/978-3-031-62645-6_13(230-238)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-62645-6_13
Cosler MHahn COmar ASchmitt F(2024)NeuroSynt: A Neuro-symbolic Portfolio Solver for Reactive SynthesisTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57256-2_3(45-67)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57256-2_3

Index Terms

Guessing Winning Policies in LTL Synthesis by Semantic Learning

Index terms have been assigned to the content through auto-classification.

Recommendations

Guessing Bank PINs by Winning a Mastermind Game

In this paper we formally prove that the problem of cracking, i.e., correctly guessing, bank PINs used for accessing Automated Teller Machines and the problem of solving the Generalized Mastermind Game are strictly related. The Generalized Mastermind ...
Personalized password guessing: a new security threat
HotSoS '14: Proceedings of the 2014 Symposium and Bootcamp on the Science of Security

This paper presents a model for generating personalized passwords (i.e., passwords based on user and service profile). A user's password is generated from a list of personalized words, each word is drawn from a topic relating to a user and the service ...
Password guessing using random forest
SEC '23: Proceedings of the 32nd USENIX Conference on Security Symposium

Passwords are the most widely used authentication method, and guessing attacks are the most effective method for password strength evaluation. However, existing password guessing models are generally built on traditional statistics or deep learning, and ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Computer Aided Verification: 35th International Conference, CAV 2023, Paris, France, July 17–22, 2023, Proceedings, Part I

Jul 2023

511 pages

ISBN:978-3-031-37705-1

DOI:10.1007/978-3-031-37706-8

Editors:
Constantin Enea
https://ror.org/05hy3tk52LIX, Ecole Polytechnique, CNRS and Institut Polytechnique de Paris, Palaiseau, France
,
Akash Lal
https://ror.org/02w7f3w92Microsoft Research, Bangalore, India

© The Author(s) 2023.

Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 17 July 2023

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gu RMoezkarimi ZSirjani M(2024)Guess and Then Check: Controller Synthesis for Safe and Secure Cyber-Physical SystemsFormal Techniques for Distributed Objects, Components, and Systems10.1007/978-3-031-62645-6_13(230-238)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-62645-6_13
Cosler MHahn COmar ASchmitt F(2024)NeuroSynt: A Neuro-symbolic Portfolio Solver for Reactive SynthesisTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57256-2_3(45-67)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57256-2_3

View Options

View options

Figures

Tables

Media

View Table of Conten