Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01886946
Contributor : Pierre Clairambault <>
Submitted on : Wednesday, October 3, 2018 - 1:53:32 PM
Last modification on : Thursday, November 21, 2019 - 2:02:19 AM
Document(s) archivé(s) le : Friday, January 4, 2019 - 2:15:17 PM

File

LIPIcs-MFCS-2017-81.pdf
Publisher files allowed on an open archive

Identifiers

Collections

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

Share

Metrics

Record views

91

Files downloads

43