Distributed Strategies Made Easy

Abstract : Distributed/concurrent strategies have been introduced as special maps of event structures. As such they factor through their "rigid images", themselves strategies. By concentrating on such "rigid image" strategies we are able to give an elementary account of distributed strategies and their composition, resulting in a category of games and strategies. This is in contrast to the usual development where composition involves the pullback of event structures explicitly and results in a bicategory. It is shown how, in this simpler setting, to extend strategies to probabilistic strategies; and indicated how through probability we can track nondeterministic branching behaviour, that one might otherwise think lost irrevocably in restricting attention to "rigid image" strategies.
Type de document :
Communication dans un congrès
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aug 2017, Aalborg, Denmark. 2017, 〈10.4230/LIPIcs.MFCS.2017.81〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01886946
Contributeur : Pierre Clairambault <>
Soumis le : mercredi 3 octobre 2018 - 13:53:32
Dernière modification le : vendredi 5 octobre 2018 - 01:16:33

Fichier

LIPIcs-MFCS-2017-81.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

Simon Castellan, Pierre Clairambault, Glynn Winskel. Distributed Strategies Made Easy. 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aug 2017, Aalborg, Denmark. 2017, 〈10.4230/LIPIcs.MFCS.2017.81〉. 〈hal-01886946〉

Partager

Métriques

Consultations de la notice

23

Téléchargements de fichiers

9