A fundamental problem in refinement verification is to check that the language of behaviors
of an implementation is included in the language of the specification. We consider the …

We study the complexity of the reachability problem for Vector Addition Systems with States
(VASSes) in fixed dimensions. We provide four lower bounds improving the currently known …

The popularity of molecular computation has given rise to several models of abstraction, one
of the more recent ones being Chemical Reaction Networks (CRNs). These are equivalent …

Seminal results establish that the coverability problem for Vector Addition Systems with
States (VASS) is in EXPSPACE (Rackoff,'78) and is EXPSPACE-hard already under unary …

Vector Addition Systems with States (VASS), equiv-alent to Petri nets, are a well-established
model of concurrency. A d-VASS can be seen as directed graph whose edges are labelled …

We study the ($\omega $-) regular separability problem for B\" uchi VASS languages: Given
two B\" uchi VASS with languages $ L_1 $ and $ L_2 $, check whether there is a regular …

Coverability in Petri nets finds applications in verification of safety properties of reactive
systems. We study coverability in the equivalent model: Vector Addition Systems with States …

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 …

This paper presents a similar approach for existential firstorder characterizations of the
languages recognizable by finite automata, by Parikh automata, and by multi-counter …

We study the reachability problem for one-counter automata in which transitions can carry
disequality tests. A disequality test is a guard that prohibits a specified counter value. This …