Work

Vector Addition System Reversible Reachability Problem

Year: 2013

Type: article

Abstract: 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.

Source: Logical Methods in Computer Science

DOI: 10.2168/lmcs-9(1:5)2013

Author: Jérôme Leroux

Institutions: Centre National de la Recherche Scientifique, Laboratoire Bordelais de Recherche en Informatique

Language: English

Topic: Petri Nets in System Modeling

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Agence Nationale de la Recherche

Awards: G4377249977, G510740806