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

Authors:
Jakub Chaloupka
Affiliations:
Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno, Czech Republic. chali@mail.muni.cz
Venue:
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Year:
2013

Citing 6
Cited 0

Petri nets: an introduction

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
Infinite Runs in Weighted Timed Automata with Energy Constraints

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
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
Faster algorithms for mean-payoff games

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.