Reachability Games on Extended Vector Addition Systems with States
Tomǎš Brázdil, Petr Jančar, Antonı́n Kučera
Abstract
Open-access reader
Tomǎš Brázdil, Petr Jančar, Antonı́n Kučera
Abstract
Open-access reader
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Undecidable problem, Reachability, Decidability, Reachability problem, Zero (linguistics), Computer science, Mathematics, Theoretical computer science