R. Alur, T. A. Henzinger, and O. Kupferman, Alternating-time temporal logic, Proc. FOCS, pp.100-109, 1997.

R. Alur, T. A. Henzinger, and O. Kupferman, Alternating-time temporal logic, Journal of the ACM, vol.49, issue.5, pp.672-713, 2002.
DOI : 10.1145/585265.585270

R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi, Alternating refinement relations, Proc. CONCUR, LNCS 1466, pp.163-178, 1998.
DOI : 10.1007/BFb0055622

M. Aizatulin, H. Schnoor, and T. Wilke, Computationally Sound Analysis of a Probabilistic Contract Signing Protocol, Proc. ESORICS, pp.571-586, 2009.
DOI : 10.3233/JCS-2003-11307

C. Baier, B. Engelen, and M. E. Majster-cederbaum, Deciding Bisimilarity and Similarity for Probabilistic Processes, Journal of Computer and System Sciences, vol.60, issue.1, pp.187-231, 2000.
DOI : 10.1006/jcss.1999.1683

K. Chatterjee, L. De-alfaro, and T. A. Henzinger, The complexity of quantitative concurrent parity games, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.678-687, 2006.
DOI : 10.1145/1109557.1109631

T. Chen and J. Lu, Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007), pp.35-39, 2007.
DOI : 10.1109/FSKD.2007.458

L. De-alfaro, T. A. Henzinger, and O. Kupferman, Concurrent reachability games, Proc. FOCS, pp.564-575, 1998.

L. De-alfaro and R. Majumdar, Quantitative solution of omega-regular games, Journal of Computer and System Sciences, vol.68, issue.2, pp.374-397, 2004.
DOI : 10.1016/j.jcss.2003.07.009

J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden, Weak Bisimulation is Sound and Complete for PCTL*, Proc. CONCUR, LNCS 2421, pp.355-370, 2002.
DOI : 10.1007/3-540-45694-5_24

E. A. Emerson, Temporal and Modal Logic, Handbook of Theoretical Computer Science (B), pp.955-1072, 1990.
DOI : 10.1016/B978-0-444-88074-1.50021-4

H. Hansson, Time and Probability in Formal Design of Distributed Systems, 1994.

N. A. Lynch, R. Segala, and F. W. Vaandrager, Observing Branching Structure through Probabilistic Contexts, SIAM Journal on Computing, vol.37, issue.4, pp.977-1013, 2007.
DOI : 10.1137/S0097539704446487
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2220

D. A. Martin, The determinacy of Blackwell games, The Journal of Symbolic Logic, vol.66, issue.04, pp.1565-1581, 1998.
DOI : 10.1007/BF02801569

R. Milner, Communication and Concurrency, 1989.

J. Von-neumann and O. Morgenstern, Theory of Games and Economic Behavior, 1947.

A. Parma and R. Segala, Logical Characterizations of Bisimulations for Discrete Probabilistic Systems, Proc. FoSSaCS, pp.287-301, 2007.
DOI : 10.1007/978-3-540-71389-0_21

T. E. Raghavan and J. A. Filar, Algorithms for stochastic games ? A survey, ZOR Zeitschrift f???r Operations Research Methods and Models of Operations Research, vol.16, issue.6, pp.437-472, 1991.
DOI : 10.1007/BF01415989

R. Segala, A compositional trace-based semantics for probabilistic automata, Proc. CONCUR, LNCS 962, pp.234-248, 1995.
DOI : 10.1007/3-540-60218-6_17

R. Segala, Modeling and Verification of Randomized Distributed Real-Time Systems, 1995.

R. Segala and N. A. Lynch, Probabilistic simulations for probabilistic processes, Nord. J. Comput, vol.2, issue.2, pp.250-273, 1995.

W. Thomas, Automata on Infinite Objects, In Handbook of Theoretical Computer Science (B), pp.133-192, 1990.
DOI : 10.1016/B978-0-444-88074-1.50009-3

C. Zhang and J. Pang, On Probabilistic Alternating Simulations, Tech. Rep, 2010.
DOI : 10.1007/978-3-642-15240-5_6
URL : https://hal.archives-ouvertes.fr/hal-01054443