Concurrent Strategies as Street Fibrations
Abstract
Concurrent games and strategies based on event structures are an established and expressive model of interactive computation. In this paper we revisit the problem of equipping this model with symmetry. Symmetry is essential for many applications, but it is also a source of mathematical complexity, not least because strategies with symmetry can be compared up to several distinct notions of equivalence. Our first contribution is a complete characterization of two classes of strategies for which composition admits an identity. For these two classes the identity laws hold, respectively, up to a "weak" and a "strong" notion of equivalence. The main result is that the weak class of strategies corresponds precisely to those inducing Street fibrations over the game. We also show how the established "thin" approach to symmetry also fits in this general framework. A second contribution is a formal connection between games and setoid-valued profunctors. This follows a long tradition of relating games and relational models, but here additionally includes a very general model of symmetries. Our characterization of strategies as Street fibrations makes the connection to profunctors significantly easier to establish.
Related
- Shrinking Kähler-Ricci solitons on toric fano fibrations
- Smoothness criterion for Fano orbifolds and bases of Lagrangian fibrations
- Compatibility of Perverse Truncation of Ngô Fibrations
- Lagrangian fibrations on hyperkahler manifolds have no multiple fibers in codimension one
- Boundedness of polarized log Calabi-Yau fibrations
BibTeX
@misc{paquet2026concurrent,
title = {{Concurrent Strategies as Street Fibrations}},
author = {Hugo Paquet and Glynn Winskel},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.37815},
eprint = {2609.37815},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.37815},
note = {CC BY-SA 4.0},
}
RIS
TY - UNPB
TI - Concurrent Strategies as Street Fibrations
AU - Hugo Paquet
AU - Glynn Winskel
PY - 2026
DA - 2026/09/29
PB - arXiv
DO - 10.48550/arxiv.2609.37815
UR - https://arxiv.org/abs/2609.37815
AB - Concurrent games and strategies based on event structures are an established and expressive model of interactive computation. In this paper we revisit the problem of equipping this model with symmetry. Symmetry is essential for many applications, but it is also a source of mathematical complexity, not least because strategies with symmetry can be compared up to several distinct notions of equivalence. Our first contribution is a complete characterization of two classes of strategies for which composition admits an identity. For these two classes the identity laws hold, respectively, up to a "weak" and a "strong" notion of equivalence. The main result is that the weak class of strategies corresponds precisely to those inducing Street fibrations over the game. We also show how the established "thin" approach to symmetry also fits in this general framework. A second contribution is a formal connection between games and setoid-valued profunctors. This follows a long tradition of relating games and relational models, but here additionally includes a very general model of symmetries. Our characterization of strategies as Street fibrations makes the connection to profunctors significantly easier to establish.
ER -