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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
