par Berwanger, Dietmar;Doyen, Laurent
Editeur scientifique Hariharan, Ramesh;Mukund, Madhavan;Vinay, V.
Référence FSTTCS(28: December 9-11, 2008: Bangalore, India), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, proceedings, Leibniz-Zentrum für Informatik, page (73-82)
Publication Publié, 2008
Publication dans des actes
Résumé : We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect information typically increase the game size exponentially. Our construction avoids such a blow-up by using imperfect information to realise succinct counters which cover a range exponentially larger than their size. In particular, the reduction shows that the problem of solving imperfect- information games with safety conditions is EXPTIME-complete. © Dietmar Berwangerand Laurent Doyen.