Abstract
Atl is a logic for multi-agent systems that enjoys model checking linear in the size of the models. Here, we point out that the size of an atl model is usually exponential in the number of agents. We establish the precise atl model checking complexity when the number of agents is considered a parameter: it turns out that the problem is Σ 2 P-complete for concurrent game structures, and NP-complete for alternating transition systems. We also show that atl model checking over the broader class of nondeterministic alternating transition systems is still NP-complete, which suggests that using the more general class of models may be convenient in practice.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time Temporal Logic. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 23–60. Springer, Heidelberg (1998)
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time Temporal Logic. Journal of the ACM 49, 672–713 (2002)
de Alfaro, L., Henzinger, T.A., Mang, F.Y.C.: The control of synchronous systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 458–473. Springer, Heidelberg (2000)
de Alfaro, L., Henzinger, T.A., Mang, F.Y.C.: The control of synchronous systems, part II. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 566–580. Springer, Heidelberg (2001)
Eiter, T.: Oral communication (March 2005)
Goranko, V.: Coalition games and alternating temporal logics. In: Proceedings of TARK VIII, pp. 259–272. Morgan Kaufmann, San Francisco (2001)
Goranko, V., Jamroga, W.: Comparing semantics of logics for multi-agent systems. Synthese 139(2), 241–280 (2004)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Schobbens, P.Y.: Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science 85(2) (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jamroga, W., Dix, J. (2005). Do Agents Make Model Checking Explode (Computationally)?. In: Pěchouček, M., Petta, P., Varga, L.Z. (eds) Multi-Agent Systems and Applications IV. CEEMAS 2005. Lecture Notes in Computer Science(), vol 3690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559221_40
Download citation
DOI: https://doi.org/10.1007/11559221_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29046-9
Online ISBN: 978-3-540-31731-9
eBook Packages: Computer ScienceComputer Science (R0)