2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2015)

Kyoto, Japan

July 6, 2015 to July 10, 2015

ISSN: 1043-6871

ISBN: 978-1-4799-8875-4

pp: 32-43

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2015.14

ABSTRACT

Known to be decidable since 1981, there still remains a huge gap between the best known lower and upper bounds for the reach ability problem for vector addition systems with states (VASS). Here the problem is shown PSPACE-complete in the two-dimensional case, vastly improving on the doubly exponential time bound established in 1986 by Howell, Rosier, Huynh and Yen. Cover ability and bounded ness for two-dimensional VASS are also shown PSPACE-complete, and reach ability in two-dimensional VASS and in integer VASS under unary encoding are considered.

INDEX TERMS

Radiation detectors, Upper bound, Encoding, Automata, Petri nets, Complexity theory, Polynomials

CITATION

Michael Blondin,
Alain Finkel,
Stefan Goller,
Christoph Haase,
Pierre McKenzie,
"Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete",

*2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)*, vol. 00, no. , pp. 32-43, 2015, doi:10.1109/LICS.2015.14CITATIONS

SEARCH