Affine Extensions of Integer Vector Addition Systems with States

by   Michael Blondin, et al.

We study the reachability problem for affine Z-VASS, which are integer vector addition systems with states in which transitions perform affine transformations on the counters. This problem is easily seen to be undecidable in general, and we therefore restrict ourselves to affine Z-VASS with the finite-monoid property (afmp-Z-VASS). The latter have the property that the monoid generated by the matrices appearing in their affine transformations is finite. The class of afmp-Z-VASS encompasses classical operations of counter machines such as resets, permutations, transfers and copies. We show that reachability in an afmp-Z-VASS reduces to reachability in a Z-VASS whose control-states grow linearly in the size of the matrix monoid. Our construction shows that reachability relations of afmp-Z-VASS are semilinear, and in particular enables us to show that reachability in Z-VASS with transfers and Z-VASS with copies is PSPACE-complete. We then focus on the reachability problem for affine Z-VASS with monogenic monoids: (possibly infinite) matrix monoids generated by a single matrix. We show that, in a particular case, the reachability problem is decidable for this class, disproving a conjecture about affine Z-VASS with infinite matrix monoids we raised in a preliminary version of this paper. We complement this result by presenting an affine Z-VASS with monogenic matrix monoid and undecidable reachability relation.



page 1

page 2

page 3

page 4


The Complexity of Reachability in Affine Vector Addition Systems with States

We give a trichotomy on the complexity of integer reachability in vector...

The Well Structured Problem for Presburger Counter Machines

We introduce the well structured problem as the question of whether a mo...

Numerical Verification of Affine Systems with up to a Billion Dimensions

Affine systems reachability is the basis of many verification methods. W...

Principally Box-integer Polyhedra and Equimodular Matrices

A polyhedron is box-integer if its intersection with any integer box {ℓ≤...

On the Decidability of Reachability in Linear Time-Invariant Systems

We consider the decidability of state-to-state reachability in linear ti...

Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free

Vector addition system with states is an ubiquitous model of computation...

VASS reachability in three steps

This note is a product of digestion of the famous proof of decidability ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.