The complexity of LTL rational synthesis

DOI10.1007/978-3-030-99524-9_2MaRDI QIDQ6535558zbMATH OpenFDO

Authors Orna Kupferman, Noam Shenwald

Publication date 23 January 2024

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

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

Recommendations

• The complexity of rational synthesis
• The complexity of rational synthesis for concurrent games
• Synthesis with rational environments
• Rational synthesis
• Synthesis of Reactive(1) designs

Cites work

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

Cited in

(1)

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

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 Q6535558)