Parameterized model checking is an active research field that considers automated
verification of distributed or concurrent systems, for all numbers of participating processes. In …

We study the reachability problem for affine Z-VASS, which are integer vector addition
systems with states in which transitions perform affine transformations on the counters. This …

The goal of parameterized verification is to prove the correctness of a system specification
regardless of the number of its components. The problem is of interest in several different …

Threshold automata, and the counter systems they define, were introduced as a framework
for parameterized model checking of fault-tolerant distributed algorithms. This application …

We show that Cubicle, an SMT-based infinite-state model checker, can be applied as a
verification engine for GLog, a logic-based specification language for topology-sensitive …

We present a formal model of publish/subscribe network architectures in which a central
communication broker is in charge of distributing messages to clients subscribed to certain …

Abstract We show that Cubicle [9], an SMT-based infinite-state model checker, can be
applied as a verification engine for GLog, a logic-based specification language for topology …

We show that Cubicle, an SMT-based infinite-state model checker, can be applied as a
verification engine for GLog, a logic-based language based on relational updates rules that …

We present a formal model of publish/subscribe network architectures in which a central
communication broker is in charge of distributing messages to clients subscribed to certain …

With the aim of increasing the modelling capability of Petri nets, we suggest that models
involve parameters to represent the weights of arcs, or the number of tokens in places. We …