AI Chat AI Image Generator AI Video Text to Speech

Reachability in 3-VASS is in Tower

06/09/2023

∙

by Qizhe Yang, et al.

∙

∙

The reachability problem for vector addition systems with states (VASS) has been shown to be Ackermann-complete. For every k≥ 3, a completeness result for the k-dimensional VASS reachability problem is not yet available. It is shown in this paper that the 3-dimensional VASS reachability problem is in Tower, improving upon the current best upper bound 𝐅_7 established by Leroux and Schmidt in 2019.

Qizhe Yang
2 publications
Yuxi Fu
3 publications

page 1

page 2

page 3

page 4

research

∙ 03/13/2020

Reachability is Tower Complete

A complete characterization of the complexity of the reachability proble...

0 Yuxi Fu, et al. ∙

research

∙ 02/18/2019

Coverability in 1-VASS with Disequality Tests

We show that the control-state reachability problem for one-dimensional ...

0 Shaull Almagor, et al. ∙

research

∙ 10/03/2022

The Geometry of Reachability in Continuous Vector Addition Systems with States

We study the geometry of reachability sets of continuous vector addition...

0 Shaull Almagor, et al. ∙

research

∙ 11/05/2022

Geometry of VAS reachability sets

Vector Addition Systems (VAS) or equivalently petri-nets are a popular m...

0 Roland Guttenberg, et al. ∙

research

∙ 11/19/2021

Benchmarks of Extended Basis Reachability Graphs

In this note, we want to provide a comparison among the efficiency of di...

0 Yin Tong, et al. ∙

research

∙ 12/13/2018

VASS reachability in three steps

This note is a product of digestion of the famous proof of decidability ...

0 Sławomir Lasota, et al. ∙

research

∙ 08/25/2022

Backwards Reachability for Probabilistic Timed Automata: A Replication Report

Backwards reachability is an efficient zone-based approach for model che...

0 Arnd Hartmanns, et al. ∙