SyncAI.news, a Varaisys broadcasting
Reachability in Symmetric VASS
{K

{\L}ukasz Kami\'nski, S{\l}awomir Lasota

· 1 min read

ResearcharXiv cs.CL

Reachability in Symmetric VASS

arXiv:2506.23578v3 Announce Type: replace-cross Abstract: We investigate the reachability problem in symmetric vector addition systems with states (VASS), where transitions are invariant under a group of permutations of coordinates. One extremal case, the trivial groups, yields general VASS. In another extremal case, the symmetric groups, we show that the reachability problem can be solved in PSPACE, regardless of the dimension of input VASS (to be contrasted with Ackermannian complexity in general VASS). We also consider other groups, in particular alternating and cyclic ones. Furthermore, motivated by the open status of the reachability problem in data VASS, we estimate the gain in complexity when the group arises as a combination of the trivial and symmetric groups.

Original source

This story was published by arXiv cs.CL and written by {\L}ukasz Kami\'nski, S{\l}awomir Lasota. SyncAI.news shows a preview; the complete article is on the publisher's site.

Read the full story on arxiv.org

Similar News