arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.10985cs.LO
收藏

求解VASS终止时间渐近界的有效算法

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

Tomáš Brázdil, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik Velan, Florian Zuleger

摘要:

带状态的向量加法系统(VASS)为分析并发进程、参数化系统提供了一个众所周知的基本模型,也被用作资源约束分析中程序的抽象模型。在本文中,我们研究的问题,获得渐近界的终止时间的一个给定的VASS。特别是,我们专注于实际上重要的情况下,获得多项式界的终止时间。我们的主要贡献如下:首先,我们提出了一个多项式时间算法来决定是否一个给定的VASS具有线性渐近复杂度。我们还表明,如果一个VASS的复杂性不是线性的,它至少是二次的。其次,我们根据VASS的循环的数量特性对其进行分类。我们发现,这些属性中的某些奇异性是VASS非多项式渐近复杂性的关键原因。在没有奇点的情况下,我们证明了渐近复杂性总是多项式的形式$Θ(n^k)$,对于一些整数$k\leq d$,其中$d$是VASS的维数。我们提出了一个多项式时间算法计算的最佳$k$。对于一般的VASS,基于用于在VASS中构造排名函数的完整技术的相同算法产生有效的下限,即,$k$,使得终止复杂度为$Ω(n^k)$。我们的研究结果是基于新的见解的几何形状的VASS动力学,它具有进一步适用于VASS分析的潜力。

英文摘要:

Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analysis of concurrent processes, parameterized systems, and are also used as abstract models of programs in resource bound analysis. In this paper we study the problem of obtaining asymptotic bounds on the termination time of a given VASS. In particular, we focus on the practically important case of obtaining polynomial bounds on termination time. Our main contributions are as follows: First, we present a polynomial-time algorithm for deciding whether a given VASS has a linear asymptotic complexity. We also show that if the complexity of a VASS is not linear, it is at least quadratic. Second, we classify VASS according to quantitative properties of their cycles. We show that certain singularities in these properties are the key reason for non-polynomial asymptotic complexity of VASS. In absence of singularities, we show that the asymptotic complexity is always polynomial and of the form $Θ(n^k)$, for some integer $k\leq d$, where $d$ is the dimension of the VASS. We present a polynomial-time algorithm computing the optimal $k$. For general VASS, the same algorithm, which is based on a complete technique for the construction of ranking functions in VASS, produces a valid lower bound, i.e., a $k$ such that the termination complexity is $Ω(n^k)$. Our results are based on new insights into the geometry of VASS dynamics, which hold the potential for further applicability to VASS analysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑