文章基本信息

标题：Vector Addition System Reversible Reachability Problem
本地全文：下载
作者：Jérôme Leroux
期刊名称：Logical Methods in Computer Science
印刷版ISSN：1860-5974
电子版ISSN：1860-5974
出版年度：2013
卷号：9
期号：1
页码：1
DOI：10.2168/LMCS-9(1:5)2013
出版社：Technical University of Braunschweig
摘要：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.
其他关键词：Vector addition system, reachability, boundedness, cover.