Saved in:
Bibliographic Details
Main Authors: Garcia-Alcalde, Sofia Garcia de Blas, Belardinelli, Francesco
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2510.17306
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912662333423616
author Garcia-Alcalde, Sofia Garcia de Blas
Belardinelli, Francesco
author_facet Garcia-Alcalde, Sofia Garcia de Blas
Belardinelli, Francesco
contents We present two novel symbolic algorithms for model checking the Alternating-time Temporal Logic ATL*, over both the infinite-trace and the finite-trace semantics. In particular, for infinite traces we design a novel symbolic reduction to parity games. We implement both methods in the ATL*AS model checker and evaluate it using synthetic benchmarks as well as a cybersecurity scenario. Our results demonstrate that the symbolic approach significantly outperforms the explicit-state representation and we find that our parity-game-based algorithm offers a more scalable and efficient solution for infinite-trace verification, outperforming previously available tools. Our results also confirm that finite-trace model checking yields substantial performance benefits over infinite-trace verification. As such, we provide a comprehensive toolset for verifying multiagent systems against specifications in ATL*.
format Preprint
id arxiv_https___arxiv_org_abs_2510_17306
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle ATL*AS: An Automata-Theoretic Approach and Tool for the Verification of Strategic Abilities in Multi-Agent Systems
Garcia-Alcalde, Sofia Garcia de Blas
Belardinelli, Francesco
Logic in Computer Science
Multiagent Systems
We present two novel symbolic algorithms for model checking the Alternating-time Temporal Logic ATL*, over both the infinite-trace and the finite-trace semantics. In particular, for infinite traces we design a novel symbolic reduction to parity games. We implement both methods in the ATL*AS model checker and evaluate it using synthetic benchmarks as well as a cybersecurity scenario. Our results demonstrate that the symbolic approach significantly outperforms the explicit-state representation and we find that our parity-game-based algorithm offers a more scalable and efficient solution for infinite-trace verification, outperforming previously available tools. Our results also confirm that finite-trace model checking yields substantial performance benefits over infinite-trace verification. As such, we provide a comprehensive toolset for verifying multiagent systems against specifications in ATL*.
title ATL*AS: An Automata-Theoretic Approach and Tool for the Verification of Strategic Abilities in Multi-Agent Systems
topic Logic in Computer Science
Multiagent Systems
url https://arxiv.org/abs/2510.17306