@article{Cachat:Uniform:2003,
    Abstract = {Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an \{EXPTIME\} procedure. We give a new presentation and a new algorithmic proof of these results, obtain a uniform solution for parity games (independent of their initial configuration), and extend the results to prefix-recognizable graphs. The winning regions of the players are proved to be effectively regular, and winning strategies are computed.},
    Author = {Cachat, Thierry},
    File = {Uniform Solution of Parity Games on Prefix-Recognizable Graphs - Cachat (0) (0) - a - a - g.pdf},
    ISSN = {1571-0661},
    Journal = {Electron. Notes Theor. Comput. Sci.},
    Note = {Infinity 2002, 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop)},
    Number = {6},
    Pages = {71--84},
    Title = {Uniform Solution of Parity Games on Prefix-Recognizable Graphs},
    URL = {http://www.sciencedirect.com/science/article/pii/S1571066104805346},
    Volume = {68},
    Year = {2003},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S1571066104805346},
    bdsk-url-2 = {http://dx.doi.org/10.1016/S1571-0661(04)80534-6},
    date-added = {2014-10-16 14:44:44 +0000},
    date-modified = {2014-10-16 14:45:31 +0000},
    doi = {10.1016/S1571-0661(04)80534-6}
}

@article{Cachat:Uniform:2003, Abstract = {Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an {EXPTIME} procedure. We give a new presentation and a new algorithmic proof of these results, obtain a uniform solution for parity games (independent of their initial configuration), and extend the results to prefix-recognizable graphs. The winning regions of the players are proved to be effectively regular, and winning strategies are computed.}, Author = {Cachat, Thierry}, File = {Uniform Solution of Parity Games on Prefix-Recognizable Graphs - Cachat (0) (0) - a - a - g.pdf}, ISSN = {1571-0661}, Journal = {Electron. Notes Theor. Comput. Sci.}, Note = {Infinity 2002, 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop)}, Number = {6}, Pages = {71--84}, Title = {Uniform Solution of Parity Games on Prefix-Recognizable Graphs}, URL = {http://www.sciencedirect.com/science/article/pii/S1571066104805346}, Volume = {68}, Year = {2003}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S1571066104805346}, bdsk-url-2 = {http://dx.doi.org/10.1016/S1571-0661(04)80534-6}, date-added = {2014-10-16 14:44:44 +0000}, date-modified = {2014-10-16 14:45:31 +0000}, doi = {10.1016/S1571-0661(04)80534-6} }