We investigate the verification of Multi-Agent Systems against strategic properties expressed
in Alternating-time Temporal Logic under the assumptions of imperfect information and …

In logics for the strategic reasoning the main challenge is represented by their verification in
contexts of imperfect information and perfect recall. In this work, we show a technique to …

An attack graph is a succinct representation of all the paths in an open system that allow an
attacker to enter a forbidden state (eg, a resource), besides any attempt of the system to …

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 …

We consider an extended version of sabotage games played over Attack Graphs. Such
games are two-player zero-sum reachability games between an Attacker and a Defender …

Effective communication among autonomous agents is crucial for coordination and solving
complex tasks within multi-agent systems. To formalize interactions between agents, social …

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 …

An attack graph is a concise portrayal of the various paths within an open system that enable
an attacker to reach a prohibited state (such as gaining access to a restricted resource) …

Behavior Trees (BTs) are high level controllers that have found use in a wide range of
robotics tasks. As they grow in popularity and usage, it is crucial to ensure that the …

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 …