Topological properties of omega context-free languages
Theoretical Computer Science
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Logical Specifications of Infinite Computations
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
IEEE Transactions on Computers
Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Infinite games and uniformization
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Church synthesis problem for noisy input
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Synthesis for regular specifications over unbounded domains
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Formal analysis of online algorithms
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Hi-index | 0.00 |
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his strategy some lookahead on the moves of the opponent. This captures situations in distributed systems, e.g. when buffers are present in communication or when signal transmission between components is deferred. We distinguish strategies with different degrees of lookahead, among them being the continuous and the bounded lookahead strategies. In the first case the lookahead is of finite possibly unbounded size, whereas in the second case it is of bounded size. We show that for regular infinite games the solvability by continuous strategies is decidable, and that a continuous strategy can always be reduced to one of bounded lookahead. Moreover, this lookahead is at most doubly exponential in the size of the parity automaton recognizing the winning condition. We also show that the result fails for non-regular games where the winning condition is given by a context-free ω-language.