Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Languages, automata, and logic
Handbook of formal languages, vol. 3
Topological properties of omega context-free languages
Theoretical Computer Science
Modal and temporal properties of processes
Modal and temporal properties of processes
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Formal languages and their relation to automata
Formal languages and their relation to automata
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Games where you can play optimally without any memory
CONCUR 2005 - Concurrency Theory
Games with winning conditions of high Borel complexity
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
On Effective Methods for Diagnosis of Retaining Faults in Circuits
Fundamenta Informaticae
Adding nesting structure to words
Journal of the ACM (JACM)
Symbolic backwards-reachability analysis for higher-order pushdown systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On infinitary rational relations and Borel sets
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
On the accepting power of 2-tape büchi automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Half-Positional determinacy of infinite games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Church synthesis problem with parameters
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On Winning Conditions of High Borel Complexity in Pushdown Games
Fundamenta Informaticae
| Hi-index | 0.00 |
We study infinite two-player games over pushdown graphs with a winning condition that refers explicitly to the infinity of the game graph: A play is won by player 0 if some vertex is visited infinity often during the play. We show that the set of winning plays is a proper 驴3-set in the Borel hierarchy, thus transcending the Boolean closure of 驴2-sets which arises with the standard automata theoretic winning conditions (such as the Muller, Rabin, or parity condition). We also show that this 驴3-game over pushdown graphs can be solved effectively (by a computation of the winning region of player 0 and his memoryless winning strategy). This seems to be a first example of an effectively solvable game beyondt he second level of the Borel hierarchy.