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. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1007/978-3-642-14162-1_40 | international colloquium on automata, languages and programming |
Keywords | DocType | Volume |
extended vector addition system,reachability game,target configuration,zero-safety objective,tractable subcases,two-player turn-based game | Conference | abs/1002.2557 |
ISSN | ISBN | Citations |
0302-9743 | 3-642-14161-7 | 48 |
PageRank | References | Authors |
2.15 | 26 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tomáš Brázdil | 1 | 194 | 13.11 |
Petr Jančar | 2 | 315 | 20.84 |
Antonín Kučera | 3 | 262 | 18.04 |