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
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Monadic Second Order Logic on Tree-Like Structures
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model Checking Linear Properties of Prefix-Recognizable Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Iterated pushdown automata and complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Games on Higher Order Multi-stack Pushdown Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
An automata-theoretic approach to infinite-state systems
Time for verification
Analysing mu-calculus properties of pushdown systems
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Tree automata make ordinal theory easy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Unsafe grammars and panic automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Regular sets over extended tree structures
Theoretical Computer Science
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
Symbolic reachability analysis of higher-order context-free processes
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Decidability of MSO theories of tree structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Degrees of lookahead in regular infinite games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Hierarchies of infinite structures generated by pushdown automata and recursion schemes
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
C-SHORe: a collapsible approach to higher-order verification
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
We consider two-player parity games played on transition graphs of higher order pushdown automata. They are "game-equivalent" to a kind of model-checking game played on graphs of the infinite hierarchy introduced recently by Caucal. Then in this hierarchy we show how to reduce a game to a graph of lower level. This leads to an effective solution and a construction of the winning strategies.