Affine Extensions of Integer Vector Addition Systems with States
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail, Raskin

TL;DR
This paper investigates the reachability problem in affine integer vector addition systems with states, focusing on classes with finite and monogenic matrix monoids, revealing decidability and complexity results.
Contribution
It introduces the finite-monoid property for affine $bZ$-VASS, reduces reachability to linear growth models, and explores decidability in monogenic cases.
Findings
Reachability in afmp-$bZ$-VASS reduces to linear growth models.
Reachability in $bZ$-VASS with transfers and copies is PSPACE-complete.
Decidability is shown for certain monogenic affine $bZ$-VASS, but some cases remain undecidable.
Abstract
We study the reachability problem for affine -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 -VASS with the finite-monoid property (afmp--VASS). The latter have the property that the monoid generated by the matrices appearing in their affine transformations is finite. The class of afmp--VASS encompasses classical operations of counter machines such as resets, permutations, transfers and copies. We show that reachability in an afmp--VASS reduces to reachability in a -VASS whose control-states grow linearly in the size of the matrix monoid. Our construction shows that reachability relations of afmp--VASS are semilinear, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
