The Complexity of Reachability in Affine Vector Addition Systems with States

by   Michael Blondin, et al.

We give a trichotomy on the complexity of integer reachability in vector addition systems with states extended with affine operations (affine VASS). Namely, we show that integer reachability in affine VASS is NP-complete for VASS with resets, PSPACE-complete for VASS with (pseudo-)transfers and VASS with (pseudo-)copies, and undecidable otherwise. We further present a dichotomy for standard reachability in affine VASS: it is decidable for VASS with permutations, and undecidable otherwise. This yields a complete and unified complexity landscape of reachability in affine VASS.



page 1

page 2

page 3

page 4


Affine Extensions of Integer Vector Addition Systems with States

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

Reachability in Vector Addition Systems is Ackermann-complete

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

Reachability Is NP-Complete Even for the Simplest Neural Networks

We investigate the complexity of the reachability problem for (deep) neu...

Affine automata verifiers

We initiate the study of the verification power of AfAs as part of Arthu...

On Decidability of 2-process Affine Models

An affine model of computation is defined as a subset of iterated immedi...

Trichotomy for the reconfiguration problem of integer linear systems

In this paper, we consider the reconfiguration problem of integer linear...

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...
This week in AI

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