Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Information and Computation - Special issue on FLOC '96
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Games where you can play optimally without any memory
CONCUR 2005 - Concurrency Theory
On the positional determinacy of edge-labeled games
Theoretical Computer Science
Half-Positional determinacy of infinite games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Omega-regular half-positional winning conditions
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.01 |
Half positionality is the property of a language of infinite words to admit positional winning strategies, when interpreted as the goal of a two-player game on a graph. Such problem applies to the automatic synthesis of controllers, where positional strategies represent efficient controllers. As our main result, we present a novel sufficient condition for half positionality, more general than what was previously known. Moreover, we compare our proposed condition with several others, proposed in the recent literature, outlining an intricate network of relationships, where only few combinations are sufficient for half positionality.