Author:
Kupferman Orna,Shenwald Noam
Abstract
AbstractInrational 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.
Publisher
Springer International Publishing
Reference27 articles.
1. 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)
2. Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 672–713 (2002)
3. 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)
4. 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)
5. 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)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献