The Complexity of LTL Rational Synthesis

Orna Kupferman, Noam Shenwald

Research output: Contribution to journalArticlepeer-review

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, when the objectives are given by formulas in Linear Temporal Logic. 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 by adding hostile players to the setting and by combining the cooperative and non-cooperative approaches studied in earlier work.

Original languageAmerican English
Article number10
JournalACM Transactions on Computational Logic
Volume25
Issue number2
DOIs
StatePublished - 16 Apr 2024

Bibliographical note

Publisher Copyright:
© 2024 Copyright held by the owner/author(s).

Keywords

  • Rational synthesis
  • complexity
  • games
  • linear temporal logic
  • tree automata

Fingerprint

Dive into the research topics of 'The Complexity of LTL Rational Synthesis'. Together they form a unique fingerprint.

Cite this