Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Journal of the ACM (JACM)
Pushdown processes: games and model-checking
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
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
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
Positional Strategies for Higher-Order Pushdown Parity Games
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Games on Multi-stack Pushdown Systems
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Winning Regions of Pushdown Parity Games: A Saturation Method
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
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
A saturation method for the modal μ-calculus over pushdown systems
Information and Computation
Effcient CTL model-checking for pushdown systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
FSTTCS '05 Proceedings of the 25th 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.89 |
We consider infinite two-player games on pushdown graphs. For parity winning conditions, we show that the set of winning positions of each player is regular and we give an effective construction of an alternating automaton recognizing it. This provides a DEXPTIME procedure to decide whether a position is winning for a given player. Finally, using the same methods, we show, for any Ω-regular winning condition, that the set of winning positions for a given player is regular and effective.