The Geometry of Reachability in Continuous Vector Addition Systems with States

10/03/2022
by   Shaull Almagor, et al.
0

We study the geometry of reachability sets of continuous vector addition systems with states (VASS). In particular we establish that they are almost Minkowski sums of convex cones and zonotopes generated by the vectors labelling the transitions of the VASS. We use the latter to prove that short so-called linear path schemes suffice as witnesses of reachability in continuous VASS of fixed dimension. Then, we give new polynomial-time algorithms for the reachability problem for linear path schemes. Finally, we also establish that enriching the model with zero tests makes the reachability problem intractable already for linear path schemes of dimension two.

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
09/17/2017

Safe & Robust Reachability Analysis of Hybrid Systems

Hybrid systems - more precisely, their mathematical models - can exhibit...
research
12/01/2017

Reachability Analysis of Large Linear Systems with Uncertain Inputs in the Krylov Subspace

One often wishes for the ability to formally analyze large-scale systems...
research
11/02/2021

Conservative Time Discretization: A Comparative Study

We present the first review of methods to overapproximate the set of rea...
research
02/18/2019

Coverability in 1-VASS with Disequality Tests

We show that the control-state reachability problem for one-dimensional ...
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
02/19/2018

Linear Equations with Ordered Data

Following a recently considered generalization of linear equations to un...

Please sign up or login with your details

Forgot password? Click here to reset