Non-angelic Concurrent Game Semantics

Abstract : The hiding operation, crucial in the compositional aspect of game semantics, removes computation paths not leading to observable results. Accordingly, games models are usually biased towards angelic non-determinism: diverging branches are forgotten. We present here new categories of games, not suffering from this bias. In our first category, we achieve this by avoiding hiding altogether; instead morphisms are uncovered strategies (with neutral events) up to weak bisimulation. Then, we show that by hiding only certain events dubbed inessential we can consider strategies up to isomorphism, and still get a category – this partial hiding remains sound up to weak bisimulation, so we get a concrete representations of programs (as in standard concurrent games) while avoiding the angelic bias. These techniques are illustrated with an interpretation of affine nondeterministic PCF which is adequate for weak bisimulation; and may, must and fair convergences.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01886951
Contributor : Pierre Clairambault <>
Submitted on : Wednesday, October 3, 2018 - 1:57:45 PM
Last modification on : Monday, April 15, 2019 - 9:44:03 AM

Links full text

Identifiers

Citation

Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel. Non-angelic Concurrent Game Semantics. 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2018), Apr 2018, Thessaloniki, Greece. ⟨10.1007/978-3-319-89366-2_1⟩. ⟨hal-01886951⟩

Share

Metrics

Record views

34