We introduce a game model for an Algol-like programming language with primitives for parallel composition and synchronization on semaphores. The semantics is based on a simplified version of Hyland-Ong-style games and it emphasizes the intuitive connection between the concurrent nature of games and that of computation. The fully abstract for may-equivalence. Key words: shared-memory concurrency, game semantics, may-equivalence
Dan R. Ghica, Andrzej S. Murawski