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 problem of verifying role-based multi-agent systems, where the number of
components cannot be determined at design time. We give a semantics that captures …

We investigate the impact of dynamic topology reconfiguration on the complexity of
verification problems for models of protocols with broadcast communication. We first …

We revisit the parameterized model checking problem for token-passing systems and
specifications in indexed CTL∗\X. Emerson and Namjoshi (1995, 2003) have shown that …

We consider the model-checking problem for a particular class of parameterized systems:
systems that consist of arbitrary numbers of components. The task is to show correctness …

We study decision problems for parameterized verification of protocols for ad hoc networks.
The problem we consider is control state reachability for networks of arbitrary size. We …

We consider parameterized verification of concurrent programs under the Total Store Order
(TSO) semantics. A program consists of a set of processes that share a set of variables on …

We study the almost-sure reachability problem in a distributed system obtained as the
asynchronous composition of N copies (called processes) of the same automaton (called …

We characterize the complexity of the safety verification problem for parameterized systems
consisting of a leader process and arbitrarily many anonymous and identical contributors …

We study cutoff results for parameterized verification and synthesis of guarded protocols, as
introduced by Emerson and Kahlon (2000). Guarded protocols describe systems of …