Paper: A game-theoretic modeling of concurrency (at LICS 1989)

Authors: Yiannis N. Moschovakis

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

BibTeX

  @InProceedings{Moschovakis-Agametheoreticmodel,
    author = 	 {Yiannis N. Moschovakis},
    title = 	 {A game-theoretic modeling of concurrency},
    booktitle =  {Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science (LICS 1989)},
    year =	 {1989},
    month =	 {June}, 
    pages =      {154--163},
    location =   {Pacific Grove, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }