Abstract. We introduce a game model for a procedural programming language extended with primitives for parallel composition and synchronization on binary semaphores. The model uses an interleaved version of Hyland-Ong-style games, where most of the original combinatorial constraints on positions are replaced with a simple principle naturally related to static process creation. The model is fully abstract for mayequivalence. 1 Introduction The two major paradigms of concurrent programming are message-passing and shared-variable. The latter style of programming is closer to the underlying machine model, which makes it both more popular and more "low-level " (and more error-prone) than the former. This constitutes very good motivation for the study of such languages. Concurrent shared-variable programming languages themselves can come in several varieties:- Fine-grained languages have designated atomic actions which are implemented directly by the hardware on which the program is executed. In contrast, coarse-grained programming languages can specify sequences of actions to appear as indivisible.- Languages with static process creation execute statements in parallel and