Reachability games on extended vector addition systems with states

  • Authors:
  • Tomáš Brázdil;Petr Jančar;Antonín Kučera

  • Affiliations:
  • Faculty of Informatics, Masaryk University, Brno, Czech Republic;Center of Applied Cybernetics, Dept. of Computer Science, FEI, Technical University of Ostrava, Ostrava, Czech Republic;Faculty of Informatics, Masaryk University, Brno, Czech Republic

  • Venue:
  • ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 thewinner in such games in 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.