Les jeux d'accessibilité généralisée

Abstract

In this paper, we consider two-player zero-sum games with generalized reachabi lity objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such games is PSPACE -complete, although it is fixed-parameter tractable with the number of reachability objectives as parameter. Moreover, we consider the memory requi rements for both players and give matching upper and lower bounds on the size of winning strategies. In order to construct more efficient algorithms, we consider subclasses of generali zed reachability games.