Implementing an ATL model checker tool using relational algebra concepts

Abstract

Alternating-Time Temporal Logic (ATL) is a branching-time temporal logic that naturally describes computations of opensystems. An open system interacts with its environment and its behavior depends on the state of the system as well as the behavior of the environment. ATL model-checking is a well-established technique for verifying that a formal model representing such a system satisfies a given property. In this paper we describe a new interactive model checker environment based on algebraic approach. Our tool is implemented in clientserver paradigm. The client part allows an interactive construction of ATL models represented by concurrent game structures as directed multi-graphs. The server part embeds an ATL model checking algorithm implemented using ANTLR and Relational Algebra expressions translated into SQL queries. The server side of our tool was published as a Web service exposing its functionality to various clients through standard XML interfaces.

Verification of JADE Agents Using ATL Model Checking

“…ATL Designer [9] implements the Tic-Tac-Toe (TTT) game, using an algorithm which looks for infallible conditional plans to achieve a winning strategy that can be defined via ATL formulae. The game is played by two opponents with a turn-based modality on a 3 × 3 board.…”

“…Using ATL Library [9] to perform ATL model checking, we can detect error states (the states of the model where the ATL formula does not hold) and then we can correct the given model or design.…”