Security protocols employing cryptographic primitives with algebraic properties are
conveniently modeled using Horn clauses modulo equational theories. We consider clauses …

We consider two-player turn-based games with zero-reachability and zero-safety objectives
generated by extended vector addition systems with states. Although the problem of …

We describe a simple, conceptual forward analysis procedure for infinity-complete WSTS S.
This computes the so-called clover of a state. When S is the completion of a WSTS X, the …

Elevators (also called" lifts" in some locales) are installed in buildings to meet the vertical
transportation needs of the building occupants. The total vertical transport capacity of a …

We study the complexity of reachability problems on branching extensions of vector addition
systems, which allows us to derive new non-elementary complexity bounds for fragments …

The covering and boundedness problems for branching vector addition systems Page 1 HAL Id:
hal-03191875 https://hal.science/hal-03191875 Submitted on 7 Apr 2021 HAL is a …

We introduce a new class of automata, which we call vector addition tree automata. These
automata are a natural generalization of vector addition systems with states, which are …

We revisit decidability results for resource-bounded logics and use decision problems on
vector addition systems with states (VASS) in order to establish complexity characterisations …

We define representations for downward-closed subsets of a rich family of well-quasi-orders,
and more generally for closed subsets of an even richer family of Noetherian topological …

We study context-bounded verification of liveness properties of multi-threaded, shared-
memory programs, where each thread can spawn additional threads. Our main result shows …