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
URL : http://doi.org/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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4577

S. Castellan and P. Clairambault, Causality vs. interleavings in concurrent game semantics, 27th International Conference on Concurrency Theory Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.1-32, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01474550

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
DOI : 10.1145/2603088.2603141
URL : https://hal.archives-ouvertes.fr/hal-00990020

S. Castellan, P. Clairambault, and G. Winskel, The Parallel Intensionally Fully Abstract Games Model of PCF, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.232-243, 2015.
DOI : 10.1109/LICS.2015.31
URL : https://hal.archives-ouvertes.fr/hal-01286477

P. Clairambault, J. Gutierrez, and G. Winskel, The Winning Ways of Concurrent Games, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.235-244, 2012.
DOI : 10.1109/LICS.2012.34

P. Clairambault, J. Gutierrez, and G. Winskel, Imperfect Information in Logic and Concurrent Games, Computation, Logic, Games, and Quantum Foundations, pp.7-20, 2013.
DOI : 10.1016/0304-3975(81)90112-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.649.962

S. Castellan, J. Hayman, M. Lasson, and G. Winskel, Strategies as Concurrent Processes, Electronic Notes in Theoretical Computer Science, vol.308, p.2014
DOI : 10.1016/j.entcs.2014.10.006
URL : https://hal.archives-ouvertes.fr/hal-01105258

P. Clairambault and G. Winskel, On Concurrent Games with Payoff, Electronic Notes in Theoretical Computer Science, vol.298, pp.71-92, 2013.
DOI : 10.1016/j.entcs.2013.09.008
URL : http://doi.org/10.1016/j.entcs.2013.09.008

L. De, A. , and T. A. Henzinger, Concurrent omega-regular games, LICS '00, pp.141-154, 2000.

T. A. Luca-de-alfaro, O. Henzinger, and . Kupferman, Concurrent reachability games, Theoretical Computer Science, vol.386, issue.3, pp.188-217, 2007.
DOI : 10.1016/j.tcs.2007.07.008

C. Faggian and M. Piccolo, Partial Orders, Event Structures and Linear Strategies, LNCS, vol.191, issue.2, pp.95-111, 2009.
DOI : 10.1016/j.ic.2003.08.004
URL : https://hal.archives-ouvertes.fr/hal-00629450

B. Genest, H. Gimbert, A. Muscholl, and I. Walukiewicz, Asynchronous Games over Tree Architectures, Proceedings, Part II, pp.275-2861, 1987.
DOI : 10.1007/978-3-642-39212-2_26
URL : https://hal.archives-ouvertes.fr/hal-00916615

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.

J. Gutierrez and G. Winskel, On the determinacy of concurrent games on event structures with infinite winning sets, Journal of Computer and System Sciences, vol.80, issue.6, pp.1119-1137, 2014.
DOI : 10.1016/j.jcss.2014.04.005

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

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

A. Joyal, Remarques sur la thorie des jeux deux personnes, Gazette des Sciences Mathematiques du Qubec, vol.1, issue.4, pp.46-52, 1977.

G. M. Kelly, Many-variable functorial calculus. I., Coherence in Categories, pp.66-105, 1972.
DOI : 10.1007/BF01898420

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

U. Dal-lago, C. Faggian, I. Hasuo, and A. Yoshimizu, The geometry of synchronization:10. [Mar98] Donald A Martin. The determinacy of blackwell games, Henzinger and Miller, pp.1-351565, 1998.

P. Es, Categorical semantics of linear logic Panoramas et syntheses [MM07] Paul-AndréMellì es and Samuel Mimram Asynchronous games: Innocence without alternation, Luís Caires and Vasco Thudichum Vasconcelos, pp.15-215, 2007.

M. Nielsen, G. Plotkin, and G. Winskel, Petri nets, event structures and domains, Theoretical Computer Science, vol.13, pp.85-108, 1981.
DOI : 10.1007/BFb0022474

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

G. Winskel, Events in computation, 1980.

G. Winskel, Event Structure Semantics for CCS and Related Languages, ICALP'82, 1982.
DOI : 10.7146/dpb.v12i159.6812

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, Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information, Festschrift for Dexter Kozen, 2012.
DOI : 10.1007/978-3-642-29485-3_19

G. Winskel, Distributed Probabilistic and Quantum Strategies, Electronic Notes in Theoretical Computer Science, vol.298, pp.403-425, 2013.
DOI : 10.1016/j.entcs.2013.09.024
URL : http://doi.org/10.1016/j.entcs.2013.09.024

G. Winskel, Strategies as Profunctors, LNCS, vol.7794, pp.418-433, 2013.
DOI : 10.1007/978-3-642-37075-5_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.248.7962