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
Games in open systems verification and synthesis
Games in open systems verification and synthesis
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 |
We study the computational complexity of solving the following problem: Given a game g played on a finite directed graph G, output all nodes in G from which a specific player wins the game g. We provide algorithms for solving the above problem when the games have Büchi and parity winning conditions and the graph G is a tree with back-edges. The running time of the algorithm for Büchi games is 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. The algorithm for parity has a running time of O(l + m).