The complexity of LTL rational synthesis

DOI10.1007/978-3-030-99524-9_2zbMath1547.68436MaRDI QIDQ6535558

Noam Shenwald, Orna Kupferman

Publication date: 23 January 2024

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (1)

Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis with rational environments
• Automata-theoretic techniques for modal logics of programs
• The temporal semantics of concurrent programs
• Imperfect information in reactive modules games
• The Price of Stability for Network Design with Fair Cost Allocation
• Alternating-time temporal logic
• Strategy Logic
• Environment Assumptions for Synthesis
• Rational Synthesis
• Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
• The Complexity of Rational Synthesis
• Algorithms, games, and the internet
• Computer Science Logic
• Algorithmic Game Theory
• Equilibrium points in n -person games
• Reasoning about Quality and Fuzziness of Strategic Behaviors

This page was built for publication: The complexity of LTL rational synthesis