The complexity of LTL rational synthesis

DOI10.1145/3648473MaRDI QIDQ6492405zbMATH OpenWikidataFDO

Authors Orna Kupferman, Noam Shenwald

Publication date 25 April 2024

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

Full work available at URL https://doi.org/10.1145/3648473

zbMATH Keywords

complexitygameslinear temporal logicrational synthesistree automata

Mathematics Subject Classification ID

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

Cites work

• Algorithmic Game Theory
• Algorithms, games, and the internet
• Alternating-time temporal logic
• Alternation
• Automata-theoretic techniques for modal logics of programs
• Computer Science Logic
• Environment Assumptions for Synthesis
• Equilibrium points in n -person games
• scientific article; zbMATH DE number 3189696 (Why is no real title available?)
• Imperfect information in reactive modules games
• Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
• Rational synthesis
• Strategy Logic
• Strategy logic
• Synthesis with rational environments
• Temporal synthesis for bounded systems and environments
• The complexity of rational synthesis
• The complexity of rational synthesis for concurrent games
• The temporal semantics of concurrent programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492405)