Reachability is Tower Complete

03/13/2020
by   Yuxi Fu, et al.
0

A complete characterization of the complexity of the reachability problem for vector addition system has been open for a long time. The problem is shown to be Tower complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2023

Reachability in 3-VASS is in Tower

The reachability problem for vector addition systems with states (VASS) ...
research
04/28/2021

Reachability in Vector Addition Systems is Ackermann-complete

Vector Addition Systems and equivalent Petri nets are a well established...
research
04/01/2022

Traversability, Reconfiguration, and Reachability in the Gadget Framework

Consider an agent traversing a graph of "gadgets", each with local state...
research
09/03/2021

Indexing Context-Sensitive Reachability

Many context-sensitive data flow analyses can be formulated as a variant...
research
11/12/2018

Compliance in Real Time Multiset Rewriting Models

The notion of compliance in Multiset Rewriting Models (MSR) has been int...
research
07/17/2020

Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free

Vector addition system with states is an ubiquitous model of computation...
research
11/19/2021

Benchmarks of Extended Basis Reachability Graphs

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

Please sign up or login with your details

Forgot password? Click here to reset