TY - JOUR
T1 - Games and strategies as event structures
AU - Castellan, Simon
AU - Clairambault, Pierre
AU - Rideau, Silvain
AU - Winskel, Glynn
PY - 2017/9/28
Y1 - 2017/9/28
N2 - In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games. In this paper we give a detailed, self-contained and slightly-updated account of the results of Rideau and Winskel: a notion of pre-strategy based on event structures; a characterisation of those pre-strategies (deemed strategies) which are preserved by composition with a copycat strategy; and the construction of a bicategory of these strategies. Furthermore, we prove that the corresponding category has a compact closed structure, and hence forms the basis for the semantics of concurrent higher-order computation.
AB - In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games. In this paper we give a detailed, self-contained and slightly-updated account of the results of Rideau and Winskel: a notion of pre-strategy based on event structures; a characterisation of those pre-strategies (deemed strategies) which are preserved by composition with a copycat strategy; and the construction of a bicategory of these strategies. Furthermore, we prove that the corresponding category has a compact closed structure, and hence forms the basis for the semantics of concurrent higher-order computation.
KW - concurrency
KW - event structures
KW - games
UR - http://www.scopus.com/inward/record.url?scp=85041825740&partnerID=8YFLogxK
U2 - 10.23638/LMCS-13(3:35)2017
DO - 10.23638/LMCS-13(3:35)2017
M3 - Article
AN - SCOPUS:85041825740
SN - 1860-5974
VL - 13
JO - Logical Methods in Computer Science
JF - Logical Methods in Computer Science
IS - 3
M1 - 35
ER -
