Computer Science – Computer Science and Game Theory
Scientific paper
2010-02-12
Computer Science
Computer Science and Game Theory
26 pages
Scientific paper
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding the winner in such games is undecidable in general, we identify several decidable and even tractable subcases of this problem obtained by restricting the number of counters and/or the sets of target configurations.
Brázdil Tomáš
Jancar Petr
Kučera Antonín
No associations
LandOfFree
Reachability Games on Extended Vector Addition Systems with States 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 Reachability Games on Extended Vector Addition Systems with States, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reachability Games on Extended Vector Addition Systems with States will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-420329