MAS

Parameterised Verification for Probabilistic Multi-agent Systems

Giving an overview of methods for verifying probabilistic multi-agent systems with a possibly unbounded number of agents.

Verifying Fault-Tolerance in Probabilistic Swarm Systems

We extend our previous work on verifying probabilistic multi-agent systems to also handle faults in the system.

Parameterised Verification of Strategic Properties in Probabilistic Multi-Agent Systems

We extend our previous work on verifying probabilistic multi-agent systems to also handle strategic properties.

A Counter Abstraction Technique for the Verification of Probabilistic Swarm Systems

Presenting joint work with Alessio Lomuscio that was previously published at AAMAS 2019.

A Counter Abstraction Technique for the Verification of Probabilistic Swarm Systems

We study a semantics, based on PLTL, for reasoning about the behaviour of an unboundedly large number of probabilistic agents.

Formal Verification of Open Multi-Agent Systems

We introduce a semantics to reason about MAS in which an arbitrarily large number of agents may join and leave at run-time.

Symbolic Synthesis of Fault-Tolerance Ratios in Parameterised Multi-Agent Systems

We study the problem of determining the robustness of a multi-agent system of unbounded size against certain faults.

Verifying Emergence of Bounded Time Properties in Probabilistic Swarm Systems

We introduce a parameterised semantics for reasoning about swarms as unbounded collections of agents in a probabilistic setting.

Verifying Fault-tolerance in Parameterised Multi-Agent Systems

Presenting work by Panagiotis Kouvaros and Alessio Lomuscio that was previously published at IJCAI 2017.