Verification of Robust Multi-Agent Systems

Abstract

Stochastic multi-agent systems are a central modeling framework for autonomous controllers, communication protocols, and cyber-physical infrastructures. In many such systems, however, transition probabilities are only estimated from data and may therefore be partially unknown or subject to perturbations. In this paper, we study the verification of robust strategies in stochastic multi-agent systems with imperfect information, in which coalitions must satisfy a temporal specification while dealing with uncertain system transitions, partial observation, and adversarial agents. By focusing on bounded-memory strategies, we introduce a robust variant of the model-checking problem for a probabilistic, observation-based extension of Alternating-time Temporal Logic. We characterize the complexity of this problem under different notions of perturbation, thereby clarifying the computational cost of robustness in stochastic multi-agent verification and supporting the use of bounded-memory strategies in uncertain environments.

Authors 4

1. Raphaël Berthon Aachen

   Centre National de la Recherche Scientifique · Université Paris-Saclay · RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University & Université Paris-Saclay, CNRS, ENS Paris-Saclay, Aachen, Germany

2. Joost-Pieter Katoen Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Aachen, Germany

3. Munyque Mittelmann

   Centre National de la Recherche Scientifique · Université Sorbonne Paris Nord · Laboratoire d'Informatique de Paris-Nord

   Affiliation as printed

   LIPN, CNRS, Université Sorbonne Paris Nord, Villetaneuse, France

4. Aniello Murano

   University of Naples Federico II

   Affiliation as printed

   University of Naples Federico II, Naples, Italy