Title :
A game-theoretic modeling of concurrency
Author :
Moschovakis, Yiannis N.
Author_Institution :
Dept. of Math., California Univ., Los Angeles, CA, USA
Abstract :
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
Keywords :
computational complexity; formal logic; game theory; parallel algorithms; Park; agent perception; asynchronous concurrent communication; concurrency; full recursion; game of interaction; game-theoretic modeling; mathematical results; naturalness; nondeterministic processes; recursive definitions; robustness; strict fair merge; Concurrent computing; Mathematical model; Mathematics; Robustness; Standards development; System recovery;
Conference_Titel :
Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on
Conference_Location :
Pacific Grove, CA
Print_ISBN :
0-8186-1954-6
DOI :
10.1109/LICS.1989.39170
