Vector Addition System Reversible Reachability Problem

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 reachabi...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science 2013-02, Vol.9, Issue 1 (1)
Main Author: Leroux, Jérôme
Format: Article
Language:English
Subjects:
Computer Science
computer science - logic in computer science
Discrete Mathematics
f.3.1
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1860-5974
1860-5974
DOI:10.2168/LMCS-9(1:5)2013