Jérôme Leroux - Vector Addition System Reversible Reachability Problem

lmcs:881 - Logical Methods in Computer Science, February 27, 2013, Volume 9, Issue 1 - https://doi.org/10.2168/LMCS-9(1:5)2013
Vector Addition System Reversible Reachability ProblemArticle

Authors: Jérôme Leroux

    The reachability problem for vector addition systems is a central problem of net theory. This problem is known to be decidable but the complexity is still unknown. Whereas the problem is EXPSPACE-hard, no elementary upper bounds complexity are known. In this paper we consider the reversible reachability problem. This problem consists to decide if two configurations are reachable one from each other, or equivalently if they are in the same strongly connected component of the reachability graph. We show that this problem is EXPSPACE-complete. As an application of the introduced materials we characterize the reversibility domains of a vector addition system.

    Volume: Volume 9, Issue 1
    Published on: February 27, 2013
    Imported on: March 29, 2012
    Keywords: Computer Science - Logic in Computer Science,F.3.1

    10 Documents citing this article

    Consultation statistics

    This page has been seen 1319 times.
    This article's PDF has been downloaded 455 times.