Abstract
In this paper we introduce and study the complexity of model checking alternating-time temporal logic (atp) with imperfect information, using a fine-structured complexity measure. While atp model checking with perfect information is linear in the size of the model when the number of agents is considered fixed, this is no longer true when the number of agents is considered parameters of the problem (fine structure).
Combining it with results from our previous papers, we get the surprising result that checking strategic abilities of agents under both perfect and imperfect information belong to the same complexity class: both problems are \(\sum^P_{2}\)-complete.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alur, R., de Alfaro, L., Grossu, R., Henzinger, T.A., Kang, M., Kirsch, C.M., Majumdar, R., Mang, F.Y.C., Wang, B.-Y.: jMocha: A model-checking tool that exploits design structure. In: Proceedings of ICSE, pp. 835–836. IEEE Computer Society Press, Los Alamitos (2001)
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time Temporal Logic. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 100–109. IEEE Computer Society Press, Los Alamitos (1997)
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)
Alur, R., Henzinger, T.A., Mang, F.Y.C., Qadeer, S., Rajamani, S.K., Tasiran, S.: MOCHA user manual. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 521–525. Springer, Heidelberg (1998)
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8(2), 244–263 (1986)
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)
Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 995–1072. Elsevier Science Publishers, Amsterdam (1990)
Emerson, E.A., Halpern, J.Y.: ”sometimes” and ”not never” revisited: On branching versus linear time temporal logic. In: Proceedings of the Annual ACM Symposium on Principles of Programming Languages, pp. 151–178 (1982)
Goranko, V.: Coalition games and alternating temporal logics. In: van Benthem, J. (ed.) 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)
Jamroga, W.: Some remarks on alternating temporal epistemic logic. In: Dunin-Keplicz, B., Verbrugge, R. (eds.) Proceedings of FAMAS 2003, pp. 133–140 (2003), Updated version. Available at http://www.in.tu-clausthal.de/~wjamroga/papers/atelremarks03FAMAS.pdf
Jamroga, W., Dix, J.: Do agents make model checking explode (computationally)? In: Pěchouček, M., Petta, P., Varga, L.Z. (eds.) CEEMAS 2005. LNCS (LNAI), vol. 3690, pp. 398–407. Springer, Heidelberg (2005)
Jamroga, W., van der Hoek, W.: Agents that know how to play. Fundamenta Informaticae 63(2–3), 185–219 (2004)
Jonker, G.: Feasible strategies in Alternating-time Temporal Epistemic Logic. Master thesis, University of Utrecht (2003)
Kacprzak, M., Penczek, W.: Unbounded model checking for Alternating-time Temporal Logic. In: Proceedings of AAMAS 2004 (2004)
Schobbens, P.Y.: Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science 85(2) (2004)
van der Hoek, W., Wooldridge, M.: Tractable multiagent planning for epistemic goals. In: Castelfranchi, C., Johnson, W.L. (eds.) Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2002), pp. 1167–1174. ACM Press, New York (2002)
van der Hoek, W., Wooldridge, M.: Cooperation, knowledge and time: Alternating-time Temporal Epistemic Logic and its applications. Studia Logica 75(1), 125–157 (2003)
van Otterloo, S., Jonker, G.: On Epistemic Temporal Strategic Logic. In: Proceedings of LCMAS, pp. 35–45 (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). Model Checking Strategic Abilities of Agents Under Incomplete Information. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_24
Download citation
DOI: https://doi.org/10.1007/11560586_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29106-0
Online ISBN: 978-3-540-32024-1
eBook Packages: Computer ScienceComputer Science (R0)