L. Aceto, A. Ingolfsdottir, and A. J. Srba, The algorithmics of bisimilarity, in Advanced Topics in, pp.100-172, 2011.

T. Ågotnes, V. Goranko, and A. W. Jamroga, Alternating-time temporal logics with irrevocable strategies, Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge , TARK '07, pp.15-24, 2007.
DOI : 10.1145/1324249.1324256

R. Alur, T. A. Henzinger, and A. O. Kupferman, Alternating-time temporal logic, 38th Annual Symposium on Foundations of Computer Science, FOCS '97, pp.100-109, 1997.
DOI : 10.1109/sfcs.1997.646098
URL : http://www-cad.eecs.berkeley.edu/~tah/Publications/alternating-time_temporal_logic.ps

R. Alur, T. A. Henzinger, and A. O. Kupferman, Alternating-time temporal logic, Journal of the ACM, vol.49, issue.5, pp.672-713, 2002.
DOI : 10.1145/585265.585270
URL : http://www-cad.eecs.berkeley.edu/~tah/Publications/alternating-time_temporal_logic.ps

W. B. Arthur, On designing economic agents that behave like human agents, Journal of Evolutionary Economics, vol.9, issue.1, pp.1-22, 1993.
DOI : 10.1037/14496-000

R. Axtell, Why agents?: on the varied motivations for agent computing in the social sciences, Center on Social and Economics Dynamics -The Brookings Institution, pp.1-23, 2000.

E. W. Beth, Semantic Entailment and Formal Derivability The foundations of mathematics: a study in the philosophy of science, Studies in logic and the foundations of mathematics, Nieuwe Reeks, Med. Konkl. Nederl. Akad. v. Wetensch, vol.18, 1955.

T. Brihaye, A. D. Lopes, F. Laroussinie, and A. N. Markey, ATL with Strategy Contexts and Bounded Memory, Logical Foundations of Computer Science, International Symposium, LFCS 2009, pp.92-106, 2009.
DOI : 10.1007/3-540-59042-0_57
URL : http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-14.pdf

M. Browne, E. Clarke, and A. O. Grümberg, Characterizing finite Kripke structures in propositional temporal logic, Theoretical Computer Science, vol.59, issue.1-2, 1988.
DOI : 10.1016/0304-3975(88)90098-9

R. M. Burstall, Program proving as hand simulation with a little induction, IFIP Congress, pp.308-312, 1974.

C. E. Cena, P. F. Cárdenas, R. S. Pazmiño, L. Puglisi, and A. R. Santonja, A cooperative multi-agent robotics system: Design and modelling, Expert Systems with Applications, vol.40, issue.12, pp.40-4737, 2013.
DOI : 10.1016/j.eswa.2013.01.048
URL : http://oa.upm.es/29098/1/INVE_MEM_2013_149322.pdf

S. Cerrito, A. David, and A. V. Goranko, Optimal tableaux-based decision procedure for testing satisfiability in the alternating-time temporal logic ATL+, Automated Reasoning, 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, pp.8562-277, 2014.

E. M. Clarke, A. Biere, R. Raimi, and A. Y. Zhu, Bounded model checking using satisfiability solving, Formal Methods in System Design, vol.19, issue.1, pp.7-34, 2001.
DOI : 10.1023/A:1011276507260

E. M. Clarke and E. A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Lecture Notes in Computer Science, vol.131, pp.52-71, 1981.
DOI : 10.1007/BFb0025774

A. David, TATL: Implementation of ATL Tableau-Based Decision Procedure, Automated Reasoning with Analytic Tableaux and Related Methods -22th International Conference, pp.97-103, 2013.
DOI : 10.1007/978-3-642-40537-2_10
URL : https://hal.archives-ouvertes.fr/hal-00880284

M. Davis and H. Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM, vol.7, issue.3, pp.201-215, 1960.
DOI : 10.1145/321033.321034

G. V. Drimmelen, Satisfiability in alternating-time temporal logic, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003.
DOI : 10.1109/LICS.2003.1210060

E. A. Emerson and E. M. Clarke, Characterizing correctness properties of parallel programs using fixpoints, Proceedings, pp.169-181, 1980.
DOI : 10.1007/3-540-10003-2_69

E. A. Emerson and J. Y. Halpern, ???Sometimes??? and ???not never??? revisited: on branching versus linear time temporal logic, Journal of the ACM, vol.33, issue.1, pp.151-178, 1986.
DOI : 10.1145/4904.4999

J. Ferber, Les Systèmes multi-agents: vers une intelligence collective, I.I.A. Informatique intelligence artificielle, 1995.

M. Fitting, Proof methods for modal and intuitionistic logics, Synthese library ; v. 169., D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Boston, 1983.
DOI : 10.1007/978-94-017-2794-5

M. Fitting, Includes index, pp.526-539

J. Franco and J. Martin, A history of satisfiability, Handbook of Satisfiability, pp.3-74, 2009.

O. Friedmann, M. Latte, and A. M. Lange, A decision procedure for CTL* based on tableaux and automata, Automated Reasoning, pp.331-345, 2010.

V. Goranko, Coalition games and alternating temporal logics, in Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge, pp.259-272, 2001.

V. Goranko-and-w and . Jamroga, Comparing semantics of logics for multi-agent systems, Synthese, pp.77-116, 2004.

V. Goranko-and-d and . Shkatov, Tableau-based decision procedures for logics of strategic ability in multiagent systems, ACM Transactions on Computational Logic, vol.11, issue.1, pp.3-4, 2009.
DOI : 10.1145/1614431.1614434

V. Goranko, G. Van, and . Drimmelen, Complete axiomatization and decidability of Alternating-time temporal logic, Theoretical Computer Science, vol.353, issue.1-3, pp.93-117, 2006.
DOI : 10.1016/j.tcs.2005.07.043

K. J. Hintikka, Two papers on symbolic logic: Form and content in quantification theory and Reductions in the theory of types, Acta philcsophica Fennica. Fasc, vol.8, 1955.

J. H. Holland and J. H. Miller, Artificial adaptive agents in economic theory, American Economic Review, vol.81, pp.365-371, 1991.

W. Jamroga-and-n and . Bulling, Comparing variants of strategic ability, IJCAI, pp.252-257, 2011.

H. W. Kamp, Tense Logic and the Theory of Linear Order, 1968.

P. C. Kanellakis and S. A. Smolka, CCS expressions, finite state processes, and three problems of equivalence, Information and Computation, vol.86, issue.1, pp.43-68, 1990.
DOI : 10.1016/0890-5401(90)90025-D

F. Kröger, A uniform logical basis for the description, in Formal Description of Programming Concepts, pp.441-459, 1978.

O. Kupferman, Recent Challenges and Ideas in Temporal Synthesis, Proceedings, M. Bieliková, pp.88-98, 2012.
DOI : 10.1007/BFb0023741
URL : http://www.cs.huji.ac.il/%7Eornak/publications/softsem12.pdf

F. Laroussinie, N. Markey, and A. G. Oreiby, On the expressiveness and complexity of ATL, Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software Proceedings, pp.4423-243, 2007.

F. Laroussinie, N. Markey, and A. G. Oreiby, On the expressiveness and complexity of ATL, Logical Methods in Computer Science, vol.4, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01194605

J. Liu and J. Wu, Multi-agent Robotic Systems, 2001.

C. Nalon, L. Zhang, C. Dixon, and A. U. Hustadt, A resolution-based calculus for Coalition Logic, Journal of Logic and Computation, vol.110111, issue.6, pp.883-917, 2014.
DOI : 10.1093/logcom/exl009

C. L. Page, P. D. Aquino, M. Etienne, and A. F. Bousquet, Processus participatif de conception et d'usage de simulations multi-agents. application à la gestion des ressources renouvelables, in Systèmes Multi-Agents Défis scientifiques et nouveaux usages -JFSMA 04 -Douxièmes journées francophones sur les systèmes multi-agents, pp.33-46, 2004.

R. Paige and R. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

M. Pauly, A Modal Logic for Coalitional Power in Games, Journal of Logic and Computation, vol.12, issue.1, pp.149-166, 2001.
DOI : 10.1093/logcom/12.1.149

A. Pereira, L. P. Reis, and A. P. Duarte, EcoSimNet: A Multi-Agent System for Ecological Simulation and Optimization, Progress in Artificial Intelligence, 14th Portuguese Conference on Artificial Intelligence Proceedings, L, pp.473-484, 2009.
DOI : 10.1007/1-4020-3030-4_7

N. Piterman, Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development, Mathematical Foundations of Computer Science, pp.45-49, 2013.
DOI : 10.1007/978-3-642-40313-2_6

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

G. Kahn, The temporal semantics of concurrent programs, Semantics of Concurrent Computation , Proceedings of the International Symposium, pp.1-20, 1979.

J. J. Queille and . Sifakis, Specification and verification of concurrent systems in CESAR, Proceedings of the 5th Colloquium on International Symposium on Programming, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, vol.12, issue.1, pp.23-41, 1965.
DOI : 10.1145/321250.321253

B. Roche, J. Guégan, and A. F. Bousquet, Multi-agent systems in epidemiology: a first step for computational biology in the study of vector-borne disease transmission, BMC Bioinformatics, vol.9, issue.1, p.435, 2008.
DOI : 10.1186/1471-2105-9-435

S. J. Russell and P. Norvig, Artificial Intelligence -A Modern Approach (3. internat, 2010.

J. Sifakis, The control of asynchronous systems: concepts, properties, static analysis, 1979.
URL : https://hal.archives-ouvertes.fr/tel-00010598

R. M. Smullyan, First-order logic, Ergebnisse der Mathematik und ihrer Grenzgebiete, 1968.

D. Walther, C. Lutz, F. Wolter, and A. M. Wooldridge, ATL Satisfiability is Indeed EXPTIME-complete, Journal of Logic and Computation, vol.16, issue.6, pp.765-787, 2006.
DOI : 10.1093/logcom/exl009
URL : http://www.csc.liv.ac.uk/~frank/publ/atl.ps

P. Wolper, The tableau method for temporal logic: An overview, Logique et Analyse, pp.119-136, 1985.

M. Wooldridge, Intelligent agents, pp.3-50, 2013.
DOI : 10.1007/3-540-58855-8