The complexity of LTL rational synthesis

DOI10.1145/3648473WikidataQ130857648 ScholiaQ130857648MaRDI QIDQ6492405

Orna Kupferman, Noam Shenwald

Publication date: 25 April 2024

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

zbMATH Keywords

complexitytree automatalinear temporal logicgamesrational synthesis

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

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

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