%0 Conference Paper %1 conf/lics/BlondinR20 %A Blondin, Michael %A Raskin, Mikhail A. %B LICS %D 2020 %E Hermanns, Holger %E Zhang, Lijun %E Kobayashi, Naoki %E Miller, Dale %I ACM %K conference %P 224-236 %T The Complexity of Reachability in Affine Vector Addition Systems with States. %U https://dl.acm.org/doi/abs/10.1145/3373718.3394741 %X Vector addition systems with states (VASS) are widely used for the formal verification of concurrent systems. Given their tremendous computational complexity, practical approaches have relied on techniques such as reachability relaxations, e.g., allowing for negative intermediate counter values. It is natural to question their feasibility for VASS enriched with primitives that typically translate into undecidability. Spurred by this concern, we pinpoint the complexity of integer relaxations w.r.t. arbitrary classes of affine operations. More specifically, we provide a trichotomy on the complexity of integer reachability in VASS extended with affine operations (affine VASS). Namely, we show that it is NP-complete for VASS with resets, PSPACE-complete for VASS with (pseudo-)transfers and VASS with (pseudo-)copies, and undecidable for any other class. We further present a dichotomy for standard reachability in affine VASS: it is decidable for VASS with permutations, and undecidable for any other class. This yields a complete and unified complexity landscape of reachability in affine VASS. %@ 978-1-4503-7104-9

@inproceedings{conf/lics/BlondinR20, abstract = {Vector addition systems with states (VASS) are widely used for the formal verification of concurrent systems. Given their tremendous computational complexity, practical approaches have relied on techniques such as reachability relaxations, e.g., allowing for negative intermediate counter values. It is natural to question their feasibility for VASS enriched with primitives that typically translate into undecidability. Spurred by this concern, we pinpoint the complexity of integer relaxations w.r.t. arbitrary classes of affine operations. More specifically, we provide a trichotomy on the complexity of integer reachability in VASS extended with affine operations (affine VASS). Namely, we show that it is NP-complete for VASS with resets, PSPACE-complete for VASS with (pseudo-)transfers and VASS with (pseudo-)copies, and undecidable for any other class. We further present a dichotomy for standard reachability in affine VASS: it is decidable for VASS with permutations, and undecidable for any other class. This yields a complete and unified complexity landscape of reachability in affine VASS.}, added-at = {2020-10-01T16:53:44.000+0200}, author = {Blondin, Michael and Raskin, Mikhail A.}, biburl = {https://www.bibsonomy.org/bibtex/24f4b6c7f363359c0716cc47fcbe3aba2/paves}, booktitle = {LICS}, crossref = {conf/lics/2020}, editor = {Hermanns, Holger and Zhang, Lijun and Kobayashi, Naoki and Miller, Dale}, ee = {https://doi.org/10.1145/3373718.3394741}, interhash = {c4ed5b61c4052451eb04f4e7dc9bc4f5}, intrahash = {4f4b6c7f363359c0716cc47fcbe3aba2}, isbn = {978-1-4503-7104-9}, keywords = {conference}, note = {https://arxiv.org/abs/1909.02579}, pages = {224-236}, publisher = {ACM}, timestamp = {2023-09-24T19:43:16.000+0200}, title = {The Complexity of Reachability in Affine Vector Addition Systems with States.}, url = {https://dl.acm.org/doi/abs/10.1145/3373718.3394741}, year = 2020 }