Strategies with Parallel Causes

Marc de Visme (1) , Glynn Winskel (2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 Computer Laboratory [Cambridge]

In a distributed game we imagine a team Player engaging a team Opponent in a distributed fashion. Such games and their strategies have been formalised in concurrent games based on event structures. However there are limitations in founding strategies on traditional event structures. Sometimes a probabilistic distributed strategy relies on certain benign races where, intuitively, several members of team Player may race each other to make a common move. Although there are event structures which support such parallel causes, in which an event is enabled in several compatible ways, they do not support an operation of hiding central to the composition of strategies; nor do they support probability adequately. An extension of traditional event structures is devised which supports parallel causes and hiding, as well as the mix of probability and nondeterminism needed to account for probabilistic distributed strategies. The extension is tested in the construction of a bicategory of probabilistic distributed strategies with parallel causes. The bicategory is rich in operations relevant to probabilistic as well as deterministic parallel programming.

Mots clés: event structures; parallel; game semantics; probability; causal unfolding

Domaines: Logique en informatique [cs.LO]

Marc de Visme, Glynn Winskel. Strategies with Parallel Causes. Computer Science Logic 2017 (CSL), Aug 2017, Stockholm, Sweden. ⟨hal-02863514⟩