On Robot Games of Degree Two

DOI10.1007/978-3-319-15579-1_17zbMath1451.68150OpenAlexW15726297MaRDI QIDQ2799175

Igor Potapov, Reino Niskanen, Vesa Halava

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_17

zbMATH Keywords

automatadecidabilityconcurrencywinning strategyreachability gamesvector addition game

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

On decidability and complexity of low-dimensional robot games

Cites Work

• Unnamed Item
• Unnamed Item
• Pushdown processes: Games and model-checking
• Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
• Integer Vector Addition Systems with States
• Alternating-time temporal logic
• Reachability Games on Extended Vector Addition Systems with States
• Decidability of second-order theories and automata on infinite trees
• On the Complexity of Counter Reachability Games
• Computer Science Logic
• An automata-theoretic approach to branching-time model checking
• Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations

This page was built for publication: On Robot Games of Degree Two