2026-07-22T08:35:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8131 2024-03-06T10:41:00Z ddc:004 open_access

Distributed Strategies Made Easy Castellan, Simon Clairambault, Pierre Winskel, Glynn Games Strategies Event Structures Probability 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Simon Castellan and Pierre Clairambault and Glynn Winskel 2017 Is Part Of LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2017.81 urn:nbn:de:0030-drops-81315 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.81 eng https://creativecommons.org/licenses/by/3.0/legalcode