AFFINE EXTENSIONS OF INTEGER VECTOR ADDITION SYSTEMS WITH STATES

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.

Automated summary

This study focuses on the reachability problem for affine Z-VASS with the finite-monoid property, showing that it can be reduced to a Z-VASS with control-states growing linearly in the size of the matrix monoid. The construction demonstrates that the reachability relations of afmp-Z-VASS are semilinear, and it also proves the PSPACE-completeness of reachability in Z-VASS with transfers and copies in certain cases. Additionally, the study explores the reachability problem for affine Z-VASS with monogenic matrix monoids, proving decidability in some cases while also presenting an instance with an undecidable reachability relation.