The complexity of rational synthesis

DOI10.4230/LIPICS.ICALP.2016.121MaRDI QIDQ4598263zbMATH OpenOpenAlexFDO

Authors Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin

Publication date 19 December 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#ConduracheFGR16

zbMATH Keywords

reactive synthesisomega-regular objectivesnon-zero sum games

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80)

Recommendations

• The complexity of rational synthesis for concurrent games
• Synthesis with rational environments
• Rational synthesis
• Rational synthesis under imperfect information
• Assume-Guarantee Synthesis

Cited in

(17)

• Dependences in strategy logic
• Dependences in strategy logic
• A game-theoretic approach for the synthesis of complex systems
• On the complexity of rational verification
• On subgame perfect equilibria in turn-based reachability timed games
• The complexity of subgame perfect equilibria in quantitative reachability games
• The Complexity of Synthesis from Probabilistic Components
• Synthesis with rational environments
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• scientific article; zbMATH DE number 7649921 (Why is no real title available?)
• scientific article; zbMATH DE number 7561653 (Why is no real title available?)
• Synthesizing Computable Functions from Rational Specifications Over Infinite Words
• Stackelberg-Pareto synthesis
• The complexity of LTL rational synthesis
• Rational synthesis
• The complexity of LTL rational synthesis
• The complexity of rational synthesis for concurrent games

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

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