D. R. Ghica and A. S. Murawski, Angelic semantics of fine-grained concurrency, FOSSACS'04, 2004.

J. Laird, A game semantics of the asynchronous pi-calculus, pp.51-65, 2005.

D. R. Ghica and A. S. Murawski, Compositional Model Extraction for Higher-Order Concurrent Programs, TACAS, ser, pp.303-317, 2006.
DOI : 10.1023/A:1008767206905

S. Abramsky and P. Mellì-es, Concurrent games and full completeness, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 1999.
DOI : 10.1109/LICS.1999.782638
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4577

P. Mellì-es, Asynchronous games 2: The true concurrency of innocence, Theoretical Computer Science, vol.358, issue.2-3, pp.200-228, 2006.
DOI : 10.1016/j.tcs.2006.01.016

P. Mellì-es and S. Mimram, Asynchronous games: Innocence without alternation, CONCUR, ser. LNCS, L. Caires and V. T. Vasconcelos, pp.395-411, 2007.

C. Faggian and M. Piccolo, Partial Orders, Event Structures and Linear Strategies, TLCA '09, ser. LNCS, 2009.
DOI : 10.1016/j.ic.2003.08.004
URL : https://hal.archives-ouvertes.fr/hal-00629450

S. Rideau and G. Winskel, Concurrent Strategies, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011.
DOI : 10.1109/LICS.2011.13

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930

A. Joyal, M. Nielsen, and G. Winskel, Bisimulation from Open Maps, BRICS Report Series, vol.1, issue.7, pp.164-185, 1996.
DOI : 10.7146/brics.v1i7.21663

P. Baillot, V. Danos, T. Ehrhard, and L. Regnier, Believe it or not, AJM's games model is a model of classical linear logic, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.68-75, 1997.
DOI : 10.1109/LICS.1997.614933

J. M. Hyland and C. L. Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917

P. Mellì-es, Asynchronous games 1: A group-theoretic formulation of uniformity, 2003.

P. Mellì-es, Categorical semantics of linear logic, Panoramas et synthèses, vol.27, pp.1-196, 2009.

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

P. Boudes, Thick Subtrees, Games and Experiments, pp.65-79, 2009.
DOI : 10.1007/978-3-540-27836-8_24

R. Harmer, M. Hyland, and P. Mellì-es, Categorical Combinatorics for Innocent Strategies, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007.
DOI : 10.1109/LICS.2007.14
URL : https://hal.archives-ouvertes.fr/hal-00150373

R. Harmer, Games and full abstraction for non-deterministic languages, 1999.