Uniform Random Generation of Balanced Parenthesis Strings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tree-Like Counterexamples in Model Checking
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
The Variable Hierarchy of the μ-Calculus Is Strict
Theory of Computing Systems
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
This paper studies algorithms for deciding the winners of two-player games played on directed graphs. We focus on the case when the underlying graphs are trees with back-edges and provide both theoretical and experimental analysis of this class of games. In particular, we present an algorithm that solves Büchi games played on trees with back-edges in time O(min{r·m, l+m}) where m is the number of edges, l is the sum of the distances from the root to all leaves and the parameter r is bounded by the height of the tree. We also show that parity games played on trees with back-edges can be solved in time O(l + m).