]. S. Références, G. Abramsky, and . Mccusker, Full abstraction for idealized algol with passive expressions, pp.3-42, 1999.

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

S. Castellan, J. Hayman, M. Lasson, and G. Winskel, Strategies as Concurrent Processes, MFPS, 2014.
DOI : 10.1016/j.entcs.2014.10.006
URL : https://hal.archives-ouvertes.fr/hal-01105258

C. Eberhart, T. Hirschowitz, and T. Seiller, Fully-abstract concurrent games for pi. CoRR, abs, 1310.

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

D. R. Ghica and A. S. Murawski, Angelic semantics of fine-grained concurrency, 2007.

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

P. Melliès and S. Mimram, Asynchronous Games: Innocence Without Alternation, CONCUR 2007 -Concurrency Theory, 18th International Conference, pp.395-411, 2007.
DOI : 10.1007/978-3-540-74407-8_27

J. C. Reynolds, Idealized algol and its specification logic. Tools and notions for program construction, pp.121-161, 1982.
DOI : 10.1007/978-1-4612-4118-8_7

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