Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

04/29/2018
by   Tomáš Brázdil, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2017

Efficient Algorithms for Checking Fast Termination in VASS

Vector Addition Systems with States (VASS) consists of a finite state sp...
research
02/13/2021

Deciding Polynomial Termination Complexity for VASS Programs

We show that for every fixed k≥ 3, the problem whether the termination/c...
research
10/23/2017

Ranking Functions for Vector Addition Systems

Vector addition systems are an important model in theoretical computer s...
research
07/25/2019

Deciding Fast Termination for Probabilistic VASS with Nondeterminism

A probabilistic vector addition system with states (pVASS) is a finite s...
research
10/30/2017

Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently

It is known that the first-order theory of rewriting is decidable for gr...
research
07/01/2019

The Polynomial Complexity of Vector Addition Systems with States

Vector addition systems are an important model in theoretical computer s...
research
07/06/2020

A Family of Denominator Bounds for First Order Linear Recurrence Systems

For linear recurrence systems, the problem of finding rational solutions...

Please sign up or login with your details

Forgot password? Click here to reset