Strategies as Concurrent Processes

Concurrent strategies are shown to support operations yielding an economic yet rich higher-order concurrent 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.

[1]  Santiago Escobar,et al.  Rewriting Logic and Its Applications , 2014, Lecture Notes in Computer Science.

[2]  Glynn Winskel,et al.  Symmetry in concurrent games , 2014, CSL-LICS.

[3]  Glynn Winskel,et al.  The Winning Ways of Concurrent Games , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[4]  Glynn Winskel.  Relations in concurrency , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[5]  Kohei Honda,et al.  Processes and Games , 2004, Electron. Notes Theor. Comput. Sci..

[6]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.

[7]  Glynn Winskel.  Strategies as Profunctors , 2013, FoSSaCS.

[8]  Glynn Winskel,et al.  Profunctors, open maps and bisimulation , 2004, Mathematical Structures in Computer Science.

[9]  Glynn Winskel,et al.  Linearity in process languages , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[10]  Martin Hyland,et al.  Some reasons for generalising domain theory , 2010, Mathematical Structures in Computer Science.

[11]  Glynn Winskel.  Event Structure Semantics for CCS and Related Languages , 2002 .

[12]  Glynn Winskel,et al.  Event Structure Spans for Nondeterministic Dataflow , 2006, EXPRESS.

[13]  Glynn Winskel,et al.  Distributed Probabilistic and Quantum Strategies , 2013, MFPS.

[14]  Tom Hirschowitz.  Full Abstraction for Fair Testing in CCS , 2013, CALCO.

[15]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[16]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[17]  G. Winskel.  Distributed Probabilistic Strategies , 2013 .

[18]  Glynn Winskel,et al.  Event Structures with Symmetry , 2007, Computation, Meaning, and Logic.

[19]  Glynn Winskel,et al.  Concurrent Strategies , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[20]  Glynn Winskel,et al.  On Concurrent Games with Payoff , 2013, MFPS.

[21]  Glynn Winskel.  Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information , 2012, Logic and Program Semantics.

[22]  Claudia Faggian,et al.  Partial Orders, Event Structures and Linear Strategies , 2009, TLCA.