Solving infinite games on trees with back-edges

@inproceedings{Gandhi2012SolvingIG,
  title={Solving infinite games on trees with back-edges},
  author={Aniruddh Gandhi and Bakhadyr Khoussainov and Jiamou Liu},
  booktitle={CATS},
  year={2012}
}
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… CONTINUE READING