Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1

  • Authors:
  • Magdalena Kacprzak;Wojciech Penczek

  • Affiliations:
  • Białystok University of Technology, Institute of Mathematics and Physics, Białystok, Poland 15-351;Aff2 Aff3

  • Venue:
  • Autonomous Agents and Multi-Agent Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Alternating-time Temporal Logic (ATL) is typically applied for specifying properties of multi-agent systems modelled by game-like structures. This paper deals with verification of ATL by means of a fully symbolic model checking. Unbounded model checking (a SAT-based technique) is applied for the first time to verification of AT. Several examples are given in order to present an application of the technique.