Petri nets: an introduction
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Decidability of bisimilarity for one-counter processes
Information and Computation
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Energy games in multiweighted automata
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Efficient controller synthesis for consumption games with multiple resource types
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Playing games with counter automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
Quantitative timed simulation functions and refinement metrics for real-time systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Optimal bounds for multiweighted and parametrised energy games
Theories of Programming and Formal Methods
| Hi-index | 0.00 |
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. Brázdil, Jančar, and Kučera (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.