pour tout vecteur de mouvements m ? ? Mov(s ? , A), il existe un vecteur de mouvements m ? Mov(s, A) tel que 1. quel que soit l'´ etat t ? de Next(s ? , A, m ? ), il existe unétatunétat t parmi Next(s, A, m) ,
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
Strategic Commitment and Release in Logics for Multi-Agent Systems, 2008. ,
Alternatingtime Temporal Logic, Journal of the ACM, pp.672-713, 2002. ,
Alternating refinement relations, Proceedings of the 9th International Conference on Concurrency Theory (CONCUR'98), pp.163-178, 1998. ,
DOI : 10.1007/BFb0055622
Stochastic Game Logic, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007), pp.227-236, 2007. ,
DOI : 10.1109/QEST.2007.38
Principles of model checking, 2008. ,
ATL with Strategy Contexts and Bounded Memory, Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'09), pp.92-106, 2009. ,
DOI : 10.1007/3-540-59042-0_57
Games with secure equilibria, Theoretical Computer Science, pp.67-82, 2006. ,
Strategy Logic, Proceedings of the 18th International Conference on Concurrency Theory (CONCUR'07), pp.59-73, 2007. ,
Strategy Logic, pp.677-693, 2010. ,
Design and Synthesis of Synchrization Skeletons using Branching-Time Temporal Logic, Proceedings of the 3rd Workshop on Logics of Programs (LOP'81), pp.52-71, 1982. ,
Automatic verification of finite-state concurrent systems using temporal logic specifications, In ACM Transactions on Programming Languages and Systems, pp.244-263, 1986. ,
Temporal and Modal Logic, Handbook of Theoretical Computer Science, pp.995-1072, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50021-4
???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
A course in game theory, 1994. ,
Module checking, Information and Computation, pp.322-344, 2001. ,
An automata-theoretic approach to branching-time model checking, Journal of the ACM, vol.47, issue.2, pp.312-360, 2000. ,
DOI : 10.1145/333979.333987
On the Expressiveness and Complexity of ATL, Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structure (FoSSaCS'07), pp.243-257, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-01194605
On the Expressiveness and Complexity of ATL, In Logical Methods in Computer Science, vol.4, issue.27, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-01194605
Infinite Games, Automata, Logics, and Infinite Games, pp.23-42, 2001. ,
DOI : 10.1007/3-540-36387-4_2
Reasoning About Strategies, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) Leibniz International Proceedings in Informatics (LIPIcs), pp.133-144, 2010. ,
Alternating automata on infinite objects, determinacy and Rabin's theorem, EPIT'84, pp.99-107, 1985. ,
DOI : 10.1007/3-540-15641-0_27
Alternating automata on infinite trees, TCS, pp.267-276, 1987. ,
DOI : 10.1016/0304-3975(87)90133-2
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra, TCS, pp.69-107, 1995. ,
DOI : 10.1016/0304-3975(94)00214-4
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies, Proceedings of the 5th International Symposium on Automated Technology for Verification and Analysis (ATVA'07), pp.253-267, 2007. ,
DOI : 10.1007/978-3-540-75596-8_19
URL : https://hal.archives-ouvertes.fr/inria-00555753
Quantified Mu-Calculus with Decision Modalities for Concurrent Game Structures ANU Computer Science Technical Reports TR-CS-07-02, 2007. ,
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
Specification and verification of concurrent systems in CESAR, Proceedings of the 5th International Symposium on Programming (SOP'82), pp.337-351, 1982. ,
DOI : 10.1007/3-540-11494-7_22
Alternating-time logic with imperfect recall, Proceedings of the 1st Workshop on Logic and Communication in Multi-Agent Systems (LCMAS'03 ENTCS 85, 2004. ,
DOI : 10.1016/S1571-0661(05)82604-0
The complexity of propositional linear temporal logics, Journal of the ACM, pp.733-749, 1985. ,
The complementation problem for Büchi automata with applications to temporal logic, Theoret. Comput. Sci. 49, pp.217-238, 1987. ,
Alternating-time temporal logic with explicit strategies, Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge , TARK '07, pp.269-278, 2007. ,
DOI : 10.1145/1324249.1324285