The surprizing complexity of generalized reachability games

Details The surprizing complexity of generalized reachability games The surprizing complexity of generalized reachability games

2010-10-12

arxiv.org/abs/1010.2420v2

Computer Science

Computational Complexity

Scientific paper

Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability 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 requirements for both players and give matching upper and lower bounds on the size of winning strategies. In order to allow more efficient algorithms, we consider subclasses of generalized reachability games. We show that bounding the size of the reachability sets gives two natural subclasses where deciding the winner can be done efficiently.

Affiliated with

Also associated with

No associations

Rating

The surprizing complexity of generalized reachability games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The surprizing complexity of generalized reachability games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The surprizing complexity of generalized reachability games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-608697