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

S. Abramsky and P. Es, Concurrent games and full completeness, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.431-442, 1999.
DOI : 10.1109/LICS.1999.782638

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

S. Castellan, P. Clairambault, and G. Winskel, Symmetry in concurrent games, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, p.28, 2014.
DOI : 10.1145/2603088.2603141
URL : https://hal.archives-ouvertes.fr/hal-00990020

C. Faggian and M. Piccolo, Partial Orders, Event Structures and Linear Strategies, Curien [5], pp.95-111
DOI : 10.1016/j.ic.2003.08.004
URL : https://hal.archives-ouvertes.fr/hal-00629450

R. Dan, A. S. Ghica, and . Murawski, Angelic semantics of fine-grained concurrency, Ann. Pure Appl. Logic, vol.151, issue.2-3, pp.89-114, 2008.

T. Hirschowitz, Full Abstraction for Fair Testing in CCS, LNCS, vol.8089, pp.175-190, 2013.
DOI : 10.1007/978-3-642-40206-7_14
URL : https://hal.archives-ouvertes.fr/hal-00826274

T. Hirschowitz and D. Pous, Innocent Strategies as Presheaves and Interactive Equivalences for CCS, Scientific Annals of Computer Science, vol.22, issue.1, pp.147-199, 2012.
DOI : 10.7561/SACS.2012.1.147
URL : https://hal.archives-ouvertes.fr/hal-00616648

J. M. Hyland and C. 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

J. Laird, Full abstraction for functional languages with control, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.58-67, 1997.
DOI : 10.1109/LICS.1997.614931

J. Laird, A Game Semantics of Idealized CSP, Electronic Notes in Theoretical Computer Science, vol.45, pp.232-257, 2001.
DOI : 10.1016/S1571-0661(04)80965-4

P. Es, Asynchronous games 4: A fully complete model of propositional linear logic, LICS, pp.386-395, 2005.

S. Paul-andrémellì-es and . Mimram, Asynchronous games: Innocence without alternation, Luís Caires and Vasco Thudichum Vasconcelos, pp.395-411, 2007.

G. D. Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, pp.223-255, 1977.
DOI : 10.1016/0304-3975(77)90044-5

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

M. Wall, Games for syntactic control of interference, 2004.

G. Winskel, Event structures, Advances in Petri Nets, pp.325-392, 1986.
DOI : 10.1007/3-540-17906-2_31
URL : https://hal.archives-ouvertes.fr/hal-00148921

G. Winskel, Event Structures with Symmetry, Electronic Notes in Theoretical Computer Science, vol.172, pp.611-652, 2007.
DOI : 10.1016/j.entcs.2007.02.022

G. Winskel, Event structures, stable families and games. Lecture notes, 2011.

G. Winskel, Strategies as Profunctors, LNCS, vol.7794, pp.418-433, 2013.
DOI : 10.1007/978-3-642-37075-5_27