VASS reachability in three steps

by   Sławomir Lasota, et al.

This note is a product of digestion of the famous proof of decidability of the reachability problem for vector addition systems with states (VASS), as first established by Mayr in 1981 and then simplified by Kosaraju in 1982. The note is neither intended to be rigorously formal nor complete; it is rather intended to be an intuitive but precise enough description of main concepts exploited in the proof. Very roughly, the overall idea is to provide a decidable condition Theta on a VASS such that Theta implies reachability and its negation implies that the size of VASS can be reduced. With these two properties, the size of input can be incrementally reduced until the problem becomes trivial. We proceed in three steps: we first formulate the condition Theta for plain VASS, then adapt it to more general VASS with unconstrained coordinates, and finally to generalized VASS of Kosaraju.


Reachability is Tower Complete

A complete characterization of the complexity of the reachability proble...

Reachability in Vector Addition Systems is Ackermann-complete

Vector Addition Systems and equivalent Petri nets are a well established...

Benchmarks of Extended Basis Reachability Graphs

In this note, we want to provide a comparison among the efficiency of di...

A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems

We introduce a sound and complete coinductive proof system for reachabil...

Affine Extensions of Integer Vector Addition Systems with States

We study the reachability problem for affine Z-VASS, which are integer v...

Coverability in 1-VASS with Disequality Tests

We show that the control-state reachability problem for one-dimensional ...

Conservative Time Discretization: A Comparative Study

We present the first review of methods to overapproximate the set of rea...