VASS reachability in three steps

12/13/2018
by   Sławomir Lasota, et al.
0

This note is a product of digestion of the famous proof of decidability of the reachability problem for vector addition systems with states (VASS), as first established by Mayr in 1981 and then simplified by Kosaraju in 1982. The note is neither intended to be rigorously formal nor complete; it is rather intended to be an intuitive but precise enough description of main concepts exploited in the proof. Very roughly, the overall idea is to provide a decidable condition Theta on a VASS such that Theta implies reachability and its negation implies that the size of VASS can be reduced. With these two properties, the size of input can be incrementally reduced until the problem becomes trivial. We proceed in three steps: we first formulate the condition Theta for plain VASS, then adapt it to more general VASS with unconstrained coordinates, and finally to generalized VASS of Kosaraju.

READ FULL TEXT
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
11/19/2021

Benchmarks of Extended Basis Reachability Graphs

In this note, we want to provide a comparison among the efficiency of di...
research
04/23/2018

A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems

We introduce a sound and complete coinductive proof system for reachabil...
research
09/26/2019

Affine Extensions of Integer Vector Addition Systems with States

We study the reachability problem for affine Z-VASS, which are integer v...
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/22/2022

Reachability in Restricted Chemical Reaction Networks

The popularity of molecular computation has given rise to several models...

Please sign up or login with your details

Forgot password? Click here to reset