BRÁZDIL, Tomáš, Petr JANČAR and Antonín KUČERA. Reachability Games on Extended Vector Addition Systems with States. Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis (Eds.). In Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP 2010). Berlin: Springer. p. 478-489. ISBN 978-3-642-14161-4. doi:10.1007/978-3-642-14162-1_40. 2010.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Reachability Games on Extended Vector Addition Systems with States
Authors BRÁZDIL, Tomáš (203 Czech Republic, belonging to the institution), Petr JANČAR (203 Czech Republic) and Antonín KUČERA (203 Czech Republic, guarantor, belonging to the institution).
Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis (Eds.).
Edition Berlin, Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), p. 478-489, 12 pp. 2010.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/10:00065875
Organization unit Faculty of Informatics
ISBN 978-3-642-14161-4
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-642-14162-1_40
UT WoS 000286344200040
Keywords in English vector addition systems; infinite games; reachability
Tags International impact
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 30/4/2014 05:23.
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 the winner 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.
Abstract (in Czech)
V článku se zkoumají hry dvou hráčů na nekonečných grafech generovaných VASS systémy, kde cílem jednoho hráče je dosáhnout danou podmnožinu stavů a druhý hráč se tomu snaží zabránit. Tento problém je v plné obecnosti nerozhodnutelný, nicméně lze identifikovat některé zajímavé podpřípady, kdy se stavá rozhodnutelným.
Links
GAP202/10/1469, research and development projectName: Formální metody pro analýzu a verifikaci komplexních systémů
Investor: Czech Science Foundation
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science
PrintDisplayed: 23/4/2024 10:35