Abstract
I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different complexity results are obtained for the same problem. Among other things, this means that the results are often distant from the “practical” complexity which is encountered when one tries to use the formalisms in reality.
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.: Reactive modules. Formal Methods in System Design 15(1), 7–48 (1999)
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. Journal of the ACM 49, 672–713 (2002)
Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proceedings of Logics of Programs Workshop. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1981)
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)
Emerson, E.A., Halpern, J.Y.: “sometimes” and “not never” revisited: On branching versus linear time temporal logic. Journal of the ACM 33(1), 151–178 (1986)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)
Jamroga, W., Ågotnes, T.: Modular interpreted systems: A preliminary report. Technical Report IfI-06-15, Clausthal University of Technology (2006)
Jamroga, W., Ågotnes, T.: Modular interpreted systems. In: Proceedings of AAMAS 2007, pp. 892–899 (2007)
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, vol. 3690, pp. 398–407. Springer, Heidelberg (2005)
Jamroga, W., Dix, J.: Model checking abilities of agents: A closer look. Theory of Computing Systems 42(3), 366–410 (2008)
Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of the ACM 47(2), 312–360 (2000)
Laroussinie, F.: About the expressive power of CTL combinators. Information Processing Letters 54(6), 343–345 (1995)
Laroussinie, F., Markey, N., Oreiby, G.: Expressiveness and complexity of ATL. Technical Report LSV-06-03, CNRS & ENS Cachan, France (2006)
McMillan, K.L.: Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, Dordrecht (1993)
Raimondi, F.: Model Checking Multi-Agent Systems. PhD thesis, University College London (2006)
Schobbens, P.Y.: Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science 85(2) (2004)
van der Hoek, W., Lomuscio, A., Wooldridge, M.: On the complexity of practical ATL model checking. In: Stone, P., Weiss, G. (eds.) Proceedings of AAMAS 2006, pp. 201–208 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jamroga, W. (2009). Easy Yet Hard: Model Checking Strategies of Agents. In: Fisher, M., Sadri, F., Thielscher, M. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2008. Lecture Notes in Computer Science(), vol 5405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02734-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-02734-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02733-8
Online ISBN: 978-3-642-02734-5
eBook Packages: Computer ScienceComputer Science (R0)