Abstract
In rational synthesis, we automatically construct a reactive system that satisfies its specification in all rational environments, namely environments that have objectives and act to fulfill them. We complete the study of the complexity of LTL rational synthesis. Our contribution is threefold. First, we tighten the known upper bounds for settings that were left open in earlier work. Second, our complexity analysis is parametric, and we describe tight upper and lower bounds in each of the problem parameters: the game graph, the objectives of the system components, and the objectives of the environment components. Third, we generalize the definition of rational synthesis, combining the cooperative and non-cooperative approaches studied in earlier work, and extend our complexity analysis to the general definition.
Download conference paper PDF
References
Almagor, S., Kupferman, O., Perelli, G.: Synthesis of controllable Nash equilibria in quantitative objective game. In: Proc. 27th Int. Joint Conf. on Artificial Intelligence. pp. 35–41 (2018)
Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 672–713 (2002)
Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. 45th IEEE Symp. on Foundations of Computer Science. pp. 295–304. IEEE Computer Society (2004)
Bouyer-Decitre, P., Kupferman, O., Markey, N., Maubert, B., Murano, A., Perelli, G.: Reasoning about quality and fuzziness of strategic behaviours. In: Proc. 28th Int. Joint Conf. on Artificial Intelligence. pp. 1588–1594 (2019)
Chatterjee, K., Henzinger, T., Jobstmann, B.: Environment assumptions for synthesis. In: Proc. 19th Int. Conf. on Concurrency Theory. Lecture Notes in Computer Science, vol. 5201, pp. 147–161. Springer (2008)
Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. In: Proc. 18th Int. Conf. on Concurrency Theory. pp. 59–73 (2007)
Chatterjee, K., Majumdar, R., Jurdzinski, M.: On Nash equilibria in stochastic games. In: Proc. 13th Annual Conf. of the European Association for Computer Science Logic. Lecture Notes in Computer Science, vol. 3210, pp. 26–40. Springer (2004)
Church, A.: Logic, arithmetics, and automata. In: Proc. Int. Congress of Mathematicians, 1962. pp. 23–35. Institut Mittag-Leffler (1963)
Condurache, R., Filiot, E., Gentilini, R., Raskin, J.F.: The complexity of rational synthesis. In: Proc. 43th Int. Colloq. on Automata, Languages, and Programming. LIPIcs, vol. 55, pp. 121:1–121:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
Emerson, E., Jutla, C.: The complexity of tree automata and logics of programs. In: Proc. 29th IEEE Symp. on Foundations of Computer Science. pp. 328–337 (1988)
Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Proc. 16th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 6015, pp. 190–204. Springer (2010)
Gutierrez, J., Najib, M., Perelli, G., Wooldridge, M.: On computational tractability for rational verification. In: Proc. 28th Int. Joint Conf. on Artificial Intelligence. pp. 329–335. International Joint Conferences on Artificial Intelligence Organization (2019)
Gutierrez, J., Perelli, G., Wooldridge, M.J.: Imperfect information in reactive modules games. Inf. Comput. 261, 650–675 (2018)
Kupferman, O., Lustig, Y., Vardi, M., Yannakakis, M.: Temporal synthesis for bounded systems and environments. In: Proc. 28th Symp. on Theoretical Aspects of Computer Science. pp. 615–626 (2011)
Kupferman, O., Perelli, G., Vardi, M.: Synthesis with rational environments. Annals of Mathematics and Artificial Intelligence 78(1), 3–20 (2016)
Kupferman, O., Piterman, N.: Lower bounds on witnesses for nonemptiness of universal co-Büchi automata. In: Proc. 12th Int. Conf. on Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science, vol. 5504, pp. 182–196. Springer (2009)
Kupferman, O., Shenwald, N.: Perspective games with notifications. In: Proc. 40th Conf. on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 182, pp. 51:1–51:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
Kupferman, O., Shenwald, N.: Perspective multi-player games. In: Proc. 36th IEEE Symp. on Logic in Computer Science (2021)
Kupferman, O., Vardi, G.: Perspective games. In: Proc. 34th IEEE Symp. on Logic in Computer Science. pp. 1 – 13 (2019)
Kupferman, O., Vardi, M.: Safraless decision procedures. In: Proc. 46th IEEE Symp. on Foundations of Computer Science. pp. 531–540 (2005)
Nash, J.: Equilibrium points in \(n\)-person games. In: Proceedings of the National Academy of Sciences of the United States of America (1950)
Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press (2007)
Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proc. 33rd ACM Symp. on Theory of Computing. pp. 749–753 (2001)
Pnueli, A.: The temporal semantics of concurrent programs. Theoretical Computer Science 13, 45–60 (1981)
Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symp. on Principles of Programming Languages. pp. 179–190 (1989)
Vardi, M., Wolper, P.: Automata-theoretic techniques for modal logics of programs. Journal of Computer and Systems Science 32(2), 182–221 (1986)
Wooldridge, M., Gutierrez, J., Harrenstein, P., Marchioni, E., Perelli, G., Toumi, A.: Rational verification: From model checking to equilibrium checking. In: Proc. of 30th National Conf. on Artificial Intelligence. pp. 4184–4190 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
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.
Copyright information
© 2022 The Author(s)
About this paper
Cite this paper
Kupferman, O., Shenwald, N. (2022). The Complexity of LTL Rational Synthesis. In: Fisman, D., Rosu, G. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2022. Lecture Notes in Computer Science, vol 13243. Springer, Cham. https://doi.org/10.1007/978-3-030-99524-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-99524-9_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-99523-2
Online ISBN: 978-3-030-99524-9
eBook Packages: Computer ScienceComputer Science (R0)
-
Published in cooperation with
http://www.etaps.org/
