Strategies as Concurrent Processes

Simon Castellan (1) , Jonathan Hayman (1) , Marc Lasson (2, 3) , Glynn Winskel (1)

1 Computer Laboratory [Cambridge]
2 PPS - Preuves, Programmes et Systèmes
3 PI.R2 - Design, study and implementation of languages for proofs and programs

Concurrent strategies are shown to support operations yielding an economic yet rich higher-order con-current process language, which shares features both with process calculi and nondeterministic dataflow. Its operational semantics and 'may and must' equivalence require that we take internal (neutral) moves seriously, leading to the introduction of 'partial strategies' which may contain neutral moves. Through partial strategies, we can present a transition semantics for a language of strategies and can formulate their 'may and must' behaviour. While partial strategies compose, in a way extending that of strategies, in general composition introduces extra neutral moves; in particular, copy-cat is no longer strictly an identity w.r.t. composition. However, a simple extension of concurrent strategies (with stopping configurations) maintains the fact that they form a bicategory while still capturing 'may and must' behaviour.

Mots clés: bicategory; Concurrent game; event structures

Domaines: Informatique

Simon Castellan, Jonathan Hayman, Marc Lasson, Glynn Winskel. Strategies as Concurrent Processes. MFPS 2014, Jun 2014, Ithaca, United States. pp.87-107, ⟨10.1016/j.entcs.2014.10.006⟩. ⟨hal-01105258⟩