Geometry of VAS reachability sets

by   Roland Guttenberg, et al.

Vector Addition Systems (VAS) or equivalently petri-nets are a popular model for representing concurrent systems. Many important decidability results about VAS were obtained by considering geometric properties of their reachability sets, i.e. the set of configurations reachable from some initial configuration c_0. For example, in 2012 Jerome Leroux proved that if a configuration c_t is not reachable, then there exists a semilinear inductive invariant separating the reachability set from c_t. This gave an alternative proof of decidability of the reachability problem. The paper introduced the class of petri-sets, proved that reachability sets are petri-sets, and that petri-sets have this property. In a follow-up paper in 2013, Jerome Leroux again used the class of petri-sets to prove that if a reachability set is semilinear, then a representation of it can be computed. In this paper, we utilize the class of petri-sets to answer the opposite type of question: Even if the reachability set is non-semilinear, what form can it have? We give another proof that semilinearity of the reachability set is decidable, which was first shown by Hauschildt in 1990. We prove that reachability sets can be partitioned into nicely shaped sets we call almost-hybridlinear, and how to utilize this to decide semilinearity.


page 1

page 2

page 3

page 4


Reachability in 3-VASS is in Tower

The reachability problem for vector addition systems with states (VASS) ...

Semilinear Home-space is Decidable for Petri Nets

A set of configurations 𝐇 is an home-space for a set of configurations 𝐗...

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...

Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs

Reachability types are a recent proposal that has shown promise in scali...

Data-Driven Reachability Analysis from Noisy Data

We consider the problem of computing reachable sets directly from noisy ...

LazySets.jl: Scalable Symbolic-Numeric Set Computations

LazySets.jl is a Julia library that provides ways to symbolically repres...

Reachability of weakly nonlinear systems using Carleman linearization

In this article we introduce a solution method for a special class of no...

Please sign up or login with your details

Forgot password? Click here to reset