Timed automata are a common formalism for the verification of concurrent systems subject to
timing constraints. They extend finite-state automata with clocks, that constrain the system …

A key difficulty in deploying multi-agent systems (MAS) in critical applications is to ensure
that the MAS under development meets its intended specifications. Languages such as …

Randomized fault-tolerant distributed algorithms pose a number of challenges for automated
verification:(i) parameterization in the number of processes and faults,(ii) randomized …

We revisit the classic problem of proving safety over parameterised concurrent systems, ie,
an infinite family of finite-state concurrent systems that are represented by some finite …

We introduce a new setting where a population of agents, each modelled by a finite-state
system, are controlled uniformly: the controller applies the same action to every agent. The …

We study verification problems for a model of network with the following characteristics: the
number of entities is parametric, communication is performed through broadcast with …

Cooperative multi-agent reinforcement learning (CMARL) enables agents to achieve a
common objective. However, the safety (aka robustness) of the CMARL agents operating in …

We consider the problem of automatically verifying that a parameterized family of
probabilistic concurrent systems terminates with probability one for all instances against …

Reconfigurable broadcast networks (RBN) are a model of distributed computation in which
agents can broadcast messages to other agents using some underlying communication …

We show the equivalence of two distributed computing models, namely reconfigurable
broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were …