On the Complexity of ATL and ATL* Module Checking

Laura Bozzelli
Aniello Murano

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.

In Patricia Bouyer, Andrea Orlandini and Pierluigi San Pietro: Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2017), Roma, Italy, 20-22 September 2017, Electronic Proceedings in Theoretical Computer Science 256, pp. 268–282.
Published: 6th September 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.256.19 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org