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.
This work has been partially supported by the Grant Agency of the Czech Republic grants No. 201/09/1389, 102/09/H042.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brázdil, T., Jančar, P., Kučera, A.: Reachability games on extended vector addition systems with states. In: Proc. International Colloquium on Automata, Languages and Programming. LNCS. Springer, Heidelberg (2010)
Chaloupka, J.: Z-reachability problem for games on 2-dimensional vector addition systems with states is in P. Technical Report FIMU-RS-2010-06, Faculty of Informatics, Masaryk University, Brno, Czech Republic (2010)
Hopcroft, J.E., Pansiot, J.-J.: On the reachablility problem for 5-dimensional vector addition systems. Theoretical Computer Science 8(2), 135–159 (1979)
Jančar, P.: Undecidability of bisimilarity for petri nets and related problems. Theoretical Computer Science 148, 281–301 (1995)
Jančar, P.: Decidability of bisimilarity for one-counter processes. Information and Computation 158, 1–17 (2000)
Reisig, W.: Petri Nets – An Introduction. Springer, Heidelberg (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaloupka, J. (2010). Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P . In: Kučera, A., Potapov, I. (eds) Reachability Problems. RP 2010. Lecture Notes in Computer Science, vol 6227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15349-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-15349-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15348-8
Online ISBN: 978-3-642-15349-5
eBook Packages: Computer ScienceComputer Science (R0)