Giving an overview of methods for verifying probabilistic multi-agent systems with a possibly unbounded number of agents.
We extend our previous work on verifying probabilistic multi-agent systems to also handle faults in the system.
We extend our previous work on verifying probabilistic multi-agent systems to also handle strategic properties.
Presenting joint work with Alessio Lomuscio that was previously published at AAMAS 2019.
We study a semantics, based on PLTL, for reasoning about the behaviour of an unboundedly large number of probabilistic agents.
We introduce a semantics to reason about MAS in which an arbitrarily large number of agents may join and leave at run-time.
We study the problem of determining the robustness of a multi-agent system of unbounded size against certain faults.
We introduce a parameterised semantics for reasoning about swarms as unbounded collections of agents in a probabilistic setting.
Presenting work by Panagiotis Kouvaros and Alessio Lomuscio that was previously published at IJCAI 2017.