34 citations · 60 across the 12 of their papers we have counts for
4 papers · 1 filter
Bridging the Gap Between Plain VASS and Branching VASS
Clotilde Bizière, Jérôme Leroux, Grégoire Sutre
Vectors addition systems with states (VASS), a model equivalent to Petri nets, are finite-state machines with finitely many counters ranging over the natural numbers. The decidable…
Solving the Reachability Problem for Branching Vector Addition Systems via Semilinear Inductive Invariants
Clotilde Bizière, Jérôme Leroux, Grégoire Sutre
In this paper, we solve the reachability problem for branching vector addition systems (BVAS), a long standing open problem. Our approach is based on semilinear inductive invariant…
On Parameterized Verification Over Tree Topologies
Romain Delpy, Anca Muscholl, Grégoire Sutre
Parameterized verification of finite-state processes with rendez-vous synchronization is notoriously undecidable when processes are linearly ordered. In this paper we study two kin…
A Forward-Only Construction of Semilinear Inductive Invariants for VAS
Clotilde Bizière, Jérôme Leroux, Grégoire Sutre
The reachability problem for Vector Addition Systems (VAS) is a central decision problem in the theory of infinite-state systems, first solved by Kosaraju and Mayr in the 1980s. An…