Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Learning to Count up to Symmetry

Pierre Clairambault 1, 2
2 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : In this paper we develop the theory of how to count, in thin concurrent games, the configurations of a strategy witnessing that it reaches a certain configuration of the game. This plays a central role in many recent developments in concurrent games, whenever one aims to relate concurrent strategies with weighted relational models. The difficulty, of course, is symmetry: in the presence of symmetry many configurations of the strategy are, morally, different instances of the same, only differing on the inessential choice of copy indices. How do we know which ones to count? The purpose of the paper is to clarify that, uncovering many strange phenomena and fascinating pathological examples along the way. To illustrate the results, we show that a collapse operation to a simple weighted relational model simply counting witnesses is preserved under composition, provided the strategies involved do not deadlock.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Pierre Clairambault <>
Submitted on : Monday, June 8, 2020 - 5:13:36 PM
Last modification on : Thursday, June 11, 2020 - 3:17:33 AM


Files produced by the author(s)


  • HAL Id : hal-02861005, version 1
  • ARXIV : 2006.05080



Pierre Clairambault. Learning to Count up to Symmetry. 2020. ⟨hal-02861005⟩



Record views


Files downloads