University of Birmingham > Talks@bham > Theoretical computer science seminar > Concurrent Games with Symmetry

Concurrent Games with Symmetry

Add to your list(s) Download to your calendar using vCal

  • UserPierre Clairambault, University of Cambridge
  • ClockTuesday 23 April 2013, 11:00-12:00
  • HouseCS 217.

If you have a question about this talk, please contact Paul Levy.

Joint Theory Seminar / Lab Lunch

Recently, Rideau and Winskel introduced a new framework of concurrent games, to serve as a new foundation for games semantics. It is based on “true concurrency” ideas, and extends the concurrent games of Abramsky and Melliès and the asynchronous games of Melliès and Mimram, allowing nondeterminism. In this new framework, we introduce a behavioural symmetry, expressing when plays are essentially the same. The addition of symmetry has profound effects on the mathematical structure of games and strategies: strategies have to respect symmetry, and this affects the definition of copycat and composition. We characterize the strategies for which copycat acts like an identity, building a ~-bicategory of games with symmetry and concurrent strategies. Thanks to the addition of symmetry, we can use concurrent games to model languages that are not resource-sensitive. We give two applications: firstly, a concurrent generalization of a variant of AJM games used by Baillot, Danos, Ehrhard and Regnier to model Classical Linear Logic. Secondly, a notion of “concurrent games with pointers”, leading to a concurrent and nondeterministic generalization of the HO framework of arenas and innocent strategies. This is joint work with Simon Castellan and Glynn Winskel.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.