Distributed Strategies Made Easy - Archive ouverte HAL
Conference Papers Year : 2017

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.
Fichier principal
Vignette du fichier
LIPIcs-MFCS-2017-81.pdf (488.09 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01886946 , version 1 (03-10-2018)

Identifiers

Cite

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. ⟨10.4230/LIPIcs.MFCS.2017.81⟩. ⟨hal-01886946⟩
96 View
56 Download

Altmetric

Share

More