A model of concurrency with fair merge and full recursion

AbstractWe introduce in this paper a model for interaction and 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 a novel interpretation of recursive definitions of non-deterministic processes. Our conceptual approach is closest to Park's, whose ideas are the starting points for this work