A game-theoretic modeling of concurrency

A model is introduced for asynchronous concurrent communication, where each agent's perception of the system is represented by a game of interaction. The model combines strict fair merge with full recursion, and the main mathematical results provide evidence for the robustness and naturalness of his interpretation of recursive definitions of nondeterministic processes. The approach is closest to D. Park's (1980, 1983) whose ideas are starting points for this work.<
>