The complexity of LTL rational synthesis

DOI10.1007/978-3-030-99524-9_2zbMATH Open1547.68436MaRDI QIDQ6535558FDOQ6535558

Authors: Orna Kupferman, Noam Shenwald 

Publication date: 23 January 2024

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)

Cites Work

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

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)