Hiding Actions in Concurrent Games

摘要

We study a class of determined two-player reachability games, played by Player_0 and Player_1 under imperfect information. Precisely, we consider the case in which Player_0 wins the game if Player_1 cannot prevent him from reaching a target state. We show that the problem of deciding such a game is ExpTime-COMPLETE.