Deciding Fast Termination for Probabilistic VASS with Nondeterminism

by   Tomáš Brázdil, et al.

A probabilistic vector addition system with states (pVASS) is a finite state Markov process augmented with non-negative integer counters that can be incremented or decremented during each state transition, blocking any behaviour that would cause a counter to decrease below zero. The pVASS can be used as abstractions of probabilistic programs with many decidable properties. The use of pVASS as abstractions requires the presence of nondeterminism in the model. In this paper, we develop techniques for checking fast termination of pVASS with nondeterminism. That is, for every initial configuration of size n, we consider the worst expected number of transitions needed to reach a configuration with some counter negative (the expected termination time). We show that the problem whether the asymptotic expected termination time is linear is decidable in polynomial time for a certain natural class of pVASS with nondeterminism. Furthermore, we show the following dichotomy: if the asymptotic expected termination time is not linear, then it is at least quadratic, i.e., in Ω(n^2).


page 1

page 2

page 3

page 4


On Lexicographic Proof Rules for Probabilistic Termination

We consider the almost-sure (a.s.) termination problem for probabilistic...

Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs

Probabilistic programs extend classical imperative programs with real-va...

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

Vector Addition Systems with States (VASS) provide a well-known and fund...

Efficient Algorithms for Checking Fast Termination in VASS

Vector Addition Systems with States (VASS) consists of a finite state sp...

Termination of Linear Loops over the Integers

We consider the problem of deciding termination of single-path while loo...

On Termination of Integer Linear Loops

We consider the problem of determining termination of single-path loops ...

Strategies for Asymptotic Normalization

We present a technique to study normalizing strategies when termination ...