Abstract Multi-Agent Systems (MAS) are notoriously complex and hard to verify. In fact, it is
not trivial to model a MAS, and even when a model is built, it is not always possible to verify …

Verifying software and hardware systems is challenging due to their complexity, often
making exhaustive verification impractical. Transitioning from monolithic systems to Multi …

The model checking problem for multi-agent systems against Strategy Logic specifications is
known to be non-elementary. On this logic several fragments have been defined to tackle …

Alternating-time Temporal Logic (ATL) is an extension of the temporal logic CTL in which we
can quantify over coalition of agents. In the model checking process, the coalitions in a given …

In this perspective paper, we propose different formalizations of games that are played over
Attack Graphs between an Attacker and a Defender. In all such games we propose a formal …

In this paper, we propose a novel formalism called Probabilistic Obstruction Temporal Logic
(POTL), which extends Obstruction Logic (OL) by incorporating probabilistic elements. POTL …

System Verification. Over the course of the past half-century, researchers have been driven
to create a multitude of verification techniques for software and hardware systems, all with …

In the context of formal verification of Multi-Agent Systems, it is common to check whether a
subset of agents (also called a coalition) can achieve specific goals of interest, usually …

Engineers design increasingly complex systems and specifications often require books to be
written on. It is an illusion to believe that implementations behave as specified, even after …

System correctness is one of the most crucial and challenging objectives in software and
hardware systems. With the increasing evolution of connected and distributed systems …