The Complexity of Rational Synthesis

DOI10.4230/LIPIcs.ICALP.2016.121zbMath1388.68163OpenAlexW2533969236MaRDI QIDQ4598263

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

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

Related Items

Dependences in Strategy Logic, On the complexity of rational verification, Unnamed Item, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, Unnamed Item, Dependences in strategy logic, On subgame perfect equilibria in turn-based reachability timed games, Unnamed Item, On relevant equilibria in reachability games, Unnamed Item, A game-theoretic approach for the synthesis of complex systems