Solving infinite games on trees with back-edges
We study the computational complexity of solving the following problem: Given a game G played on a fi- nite directed graph G, output all nodes in G from which a specific player wins the game G. We pro- vide algorithms for solving the above problem when the games have Büchi and parity winning condit...
| Main Authors: | , , |
|---|---|
| Format: | Others |
| Published: |
Australian Computer Society (ACS),
2011-11-27T08:42:52Z.
|
| Subjects: | |
| Online Access: | Get fulltext |