Symbolic Solution of Emerson-Lei Games for Reactive Synthesis
Pages 55 - 78
Abstract
Emerson-Lei conditions have recently attracted attention due to both their succinctness and their favorable closure properties. In the current work, we show how infinite-duration games with Emerson-Lei objectives can be analyzed in two different ways. First, we show that the Zielonka tree of the Emerson-Lei condition naturally gives rise to a new reduction to parity games. This reduction, however, does not result in optimal analysis. Second, we show based on the first reduction (and the Zielonka tree) how to provide a direct fixpoint-based characterization of the winning region. The fixpoint-based characterization allows for symbolic analysis. It generalizes the solutions of games with known winning conditions such as Büchi, GR[1], parity, Streett, Rabin and Muller objectives, and in the case of these conditions reproduces previously known symbolic algorithms and complexity results.
We also show how the capabilities of the proposed algorithm can be exploited in reactive synthesis, suggesting a new expressive fragment of LTL that can be handled symbolically. Our fragment combines a safety specification and a liveness part. The safety part is unrestricted and the liveness part allows to define Emerson-Lei conditions on occurrences of letters. The symbolic treatment is enabled due to the simplicity of determinization in the case of safety languages and by using our new algorithm for game solving. This approach maximizes the number of steps solved symbolically in order to maximize the potential for efficient symbolic implementations.
References
[1]
Armoni, R., Egorov, S., Fraer, R., Korchemny, D., Vardi, M.Y.: Efficient LTL compilation for sat-based model checking. In: International Conference on Computer-Aided Design. pp. 877–884. IEEE Computer Society (2005).
[2]
Arnold, A., Niwinski, D., Parys, P.: A quasi-polynomial black-box algorithm for fixed point evaluation. In: Baier, C., Goubault-Larrecq, J. (eds.) 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (Virtual Conference). LIPIcs, vol. 183, pp. 9:1–9:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021).
[3]
Artale, A., Geatti, L., Gigante, N., Mazzullo, A., Montanari, A.: Complexity of safety and cosafety fragments of linear temporal logic. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 6236–6244 (2023)
[4]
Baldan, P., König, B., Mika-Michalski, C., Padoan, T.: Fixpoint games on continuous lattices. Proc. ACM Program. Lang. 3(POPL), 26:1–26:29 (2019).
[5]
Bansal, S., Giacomo, G.D., Stasio, A.D., Li, Y., Vardi, M.Y., Zhu, S.: Compositional safety LTL synthesis. In: 14th International Conference on Verified Software, Theories, Tools and Experiments. Lecture Notes in Computer Science, vol. 13800, pp. 1–19. Springer (2022).
[6]
Bhatia, A., Maly, M.R., Kavraki, L.E., Vardi, M.Y.: Motion planning with complex goals. IEEE Robotics Autom. Mag. 18(3), 55–64 (2011).
[7]
Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa’ar, Y.: Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78(3), 911–938 (2012).
[8]
Bruse, F., Falk, M., Lange, M.: The fixpoint-iteration algorithm for parity games. In: International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2014. EPTCS, vol. 161, pp. 116–130 (2014).
[9]
Calude, C., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: Theory of Computing, STOC 2017. pp. 252–263. ACM (2017)
[10]
Camacho, A., McIlraith, S.A.: Learning interpretable models expressed in linear temporal logic. In: Twenty-Ninth International Conference on Automated Planning and Scheduling. pp. 621–630. AAAI Press (2019).
[11]
Camacho, A., Triantafillou, E., Muise, C.J., Baier, J.A., McIlraith, S.A.: Non-deterministic planning with temporally extended goals: LTL over finite and infinite traces. In: Thirty-First AAAI Conference on Artificial Intelligence. pp. 3716–3724. AAAI Press (2017).
[12]
Casares, A., Colcombet, T., Lehtinen, K.: On the size of good-for-games rabin automata and its link with the memory in muller games. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) International Colloquium on Automata, Languages, and Programming, ICALP 2022. LIPIcs, vol. 229, pp. 117:1–117:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022).
[13]
Casares, A., Duret-Lutz, A., Meyer, K.J., Renkin, F., Sickert, S.: Practical applications of the alternating cycle decomposition. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part II. Lecture Notes in Computer Science, vol. 13244, pp. 99–117. Springer (2022).
[14]
Church, A.: Logic, arithmetic, and automata. In: International Congress of Mathematicians. Institut Mittag-Leffler, Sweden (1963)
[15]
Cimatti, A., Geatti, L., Gigante, N., Montanari, A., Tonetta, S.: Fairness, assumptions, and guarantees for extended bounded response ltl+p synthesis. Software and System Modeling (2023).
[16]
D’Antoni, L., Veanes, M.: Minimization of symbolic automata. In: Symposium on Principles of Programming Languages (POPL). pp. 541–554. ACM (2014).
[17]
Duret-Lutz, A., Renault, E., Colange, M., Renkin, F., Aisse, A.G., Schlehuber-Caissier, P., Medioni, T., Martin, A., Dubois, J., Gillard, C., Lauko, H.: From spot 2.0 to spot 2.10: What’s new? In: 34th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 13372, pp. 174–187. Springer (2022).
[18]
Dziembowski, S., Jurdzinski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: 12th Annual IEEE Symposium on Logic in Computer Science. pp. 99–110. IEEE Computer Society (1997).
[19]
Ehlers, R.: Generalized rabin(1) synthesis with applications to robust system synthesis. In: Third International Symposium on NASA Formal Methods. Lecture Notes in Computer Science, vol. 6617, pp. 101–115. Springer (2011).
[20]
Ehlers, R.: Unbeast: Symbolic bounded synthesis. In: 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 6605, pp. 272–275. Springer (2011).
[21]
Emerson, E.A., Lei, C.: Modalities for model checking: Branching time logic strikes back. Sci. Comput. Program. 8(3), 275–306 (1987).
[22]
Giacomo, G.D., Vardi, M.Y.: Synthesis for LTL and LDL on finite traces. In: Yang, Q., Wooldridge, M.J. (eds.) Twenty-Fourth International Joint Conference on Artificial Intelligence. pp. 1558–1564. AAAI Press (2015)
[23]
Hausmann, D., Lehaut, M., Piterman, N.: Symbolic solution of Emerson-Lei games for reactive synthesis. CoRR abs/2305.02793 (2023), https://arxiv.org/abs/2305.02793
[24]
Hausmann, D., Schröder, L.: Quasipolynomial computation of nested fixpoints. In: Groote, J.F., Larsen, K.G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12651, pp. 38–56. Springer (2021).
[25]
Hunter, P., Dawar, A.: Complexity bounds for regular games. In: 30th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 3618, pp. 495–506. Springer (2005).
[26]
John, T., Jantsch, S., Baier, C., Klüppelholz, S.: Determinization and limit-determinization of Emerson-Lei automata. In: 19th International Symposium on Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, vol. 12971, pp. 15–31. Springer (2021).
[27]
John, T., Jantsch, S., Baier, C., Klüppelholz, S.: From emerson-lei automata to deterministic, limit-deterministic or good-for-mdp automata. Innov. Syst. Softw. Eng. 18(3), 385–403 (2022).
[28]
Kress-Gazit, H., Fainekos, G.E., Pappas, G.J.: Temporal-logic-based reactive mission and motion planning. IEEE Trans. Robotics 25(6), 1370–1381 (2009).
[29]
Kugler, H., Segall, I.: Compositional synthesis of reactive systems from live sequence chart specifications. In: 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 5505, pp. 77–91. Springer (2009).
[30]
Kupferman, O., Vardi, M.Y.: Model checking of safety properties. Formal methods in system design 19(3), 291–314 (2001).
[31]
Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Conference on Logics of Programs. Lecture Notes in Computer Science, vol. 193, pp. 196–218. Springer (1985).
[32]
Liu, J., Ozay, N., Topcu, U., Murray, R.M.: Synthesis of reactive switching protocols from temporal logic specifications. IEEE Trans. Autom. Control. 58(7), 1771–1785 (2013).
[33]
Majumdar, R., Schmuck, A.: Supervisory controller synthesis for nonterminating processes is an obliging game. IEEE Trans. Autom. Control. 68(1), 385–392 (2023).
[34]
Moarref, S., Kress-Gazit, H.: Automated synthesis of decentralized controllers for robot swarms from high-level temporal logic specifications. Auton. Robots 44(3-4), 585–600 (2020).
[35]
Müller, D., Sickert, S.: LTL to deterministic emerson-lei automata. In: Bouyer, P., Orlandini, A., Pietro, P.S. (eds.) Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2017, Roma, Italy, 20-22 September 2017. EPTCS, vol. 256, pp. 180–194 (2017).
[36]
Piterman, N., Pnueli, A.: Faster solutions of rabin and streett games. In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings. pp. 275–284. IEEE Computer Society (2006).
[37]
Piterman, N., Pnueli, A., Sa’ar, Y.: Synthesis of reactive(1) designs. In: 7th International Conference on Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science, vol. 3855, pp. 364–380. Springer (2006).
[38]
Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Sixteenth ACM Symposium on Principles of Programming Languages. pp. 179–190. ACM Press (1989).
[39]
Raman, V., Piterman, N., Finucane, C., Kress-Gazit, H.: Timing semantics for abstraction and execution of synthesized high-level robot control. IEEE Trans. Robotics 31(3), 591–604 (2015).
[40]
Renkin, F., Duret-Lutz, A., Pommellet, A.: Practical "paritizing" of emerson-lei automata. In: Hung, D.V., Sokolsky, O. (eds.) Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12302, pp. 127–143. Springer (2020).
[41]
Sohail, S., Somenzi, F.: Safety first: a two-stage algorithm for the synthesis of reactive systems. Int. J. Softw. Tools Technol. Transf. 15(5-6), 433–454 (2013).
[42]
Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science, vol. 3835, pp. 396–411. Springer (2005).
[43]
Vardi, M.Y., Stockmeyer, L.J.: Improved upper and lower bounds for modal logics of programs: Preliminary report. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing. pp. 240–251. ACM (1985)
[44]
Wongpiromsarn, T., Topcu, U., Murray, R.M.: Receding horizon temporal logic planning. IEEE Trans. Autom. Control. 57(11), 2817–2830 (2012).
[45]
Zhu, S., Tabajara, L.M., Li, J., Pu, G., Vardi, M.Y.: A symbolic approach to safety LTL synthesis. In: 13th International Haifa Verification Conference: Hardware and Software - Verification and Testing. Lecture Notes in Computer Science, vol. 10629, pp. 147–162. Springer (2017).
[46]
Zhu, S., Tabajara, L.M., Pu, G., Vardi, M.Y.: On the power of automata minimization in temporal synthesis. In: Proceedings 12th International Symposium on Games, Automata, Logics, and Formal Verification. EPTCS, vol. 346, pp. 117–134 (2021).
[47]
Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1-2), 135–183 (1998).
Recommendations
Visibly pushdown games
FSTTCS'04: Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer ScienceThe class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown ...
Symbolic computational techniques for solving games
Games are useful in modular specification and analysis of systems where the distinction among the choices controlled by different components (for instance, the system and its environment) is made explicit. In this paper, we formulate and compare various ...
Comments
Information & Contributors
Information
Published In
Apr 2024
289 pages
© The Author(s) 2024.
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: 06 April 2024
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025