Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P

被引:5
|
作者
Chaloupka, Jakub [1 ]
机构
[1] Masaryk Univ, Fac Informat, Brno 60200, Czech Republic
关键词
BISIMILARITY;
D O I
10.3233/FI-2013-798
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We consider a two-player infinite game with zero-reachability objectives played on a 2-dimensional vector addition system with states (VASS), the states of which are divided between the two players. Brazdil, Jancar, and Kucera (2010) have shown that for k > 0, deciding the winner in a game on k-dimensional VASS is in (k - 1)-EXPTIME. In this paper, we show that, for k = 2, the problem is in P, and thus improve the EXPTIME upper bound.
引用
收藏
页码:15 / 42
页数:28
相关论文
共 50 条