On the Complexity of ATL and ATL* Module Checking

09/07/2017
by   Laura Bozzelli, et al.
0

Module checking has been introduced in late 1990s to verify open systems, i.e., systems whose behavior depends on the continuous interaction with the environment. Classically, module checking has been investigated with respect to specifications given as CTL and CTL* formulas. Recently, it has been shown that CTL (resp., CTL*) module checking offers a distinctly different perspective from the better-known problem of ATL (resp., ATL*) model checking. In particular, ATL (resp., ATL*) module checking strictly enhances the expressiveness of both CTL (resp., CTL*) module checking and ATL (resp. ATL*) model checking. In this paper, we provide asymptotically optimal bounds on the computational cost of module checking against ATL and ATL*, whose upper bounds are based on an automata-theoretic approach. We show that module-checking for ATL is EXPTIME-complete, which is the same complexity of module checking against CTL. On the other hand, ATL* module checking turns out to be 3EXPTIME-complete, hence exponentially harder than CTL* module checking.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2020

Module checking of pushdown multi-agent systems

In this paper, we investigate the module-checking problem of pushdown mu...
research
07/25/2018

Model Checking Quantum Systems --- A Survey

This article discusses the essential difficulties in developing model-ch...
research
01/25/2022

The multiplicative complexity of interval checking

We determine the exact AND-gate cost of checking if a≤ x < b, where a an...
research
07/17/2012

Qualitative Approximate Behavior Composition

The behavior composition problem involves automatically building a contr...
research
05/15/2023

On Strategies in Synthesis Over Finite Traces

The innovations in reactive synthesis from Linear Temporal Logics over f...
research
06/19/2017

Generic Approach to Certified Static Checking of Module-like Constructs

In this paper we consider the problem of certified static checking of mo...
research
04/27/2022

Fairness and promptness in Muller formulas

In this paper we consider two different views of the model checking prob...

Please sign up or login with your details

Forgot password? Click here to reset