{"title":"A model of concurrency with fair merge and full recursion","authors":"Yiannis N. Moschovakis","doi":"10.1016/0890-5401(91)90054-6","DOIUrl":null,"url":null,"abstract":"<div><div>We introduce in this paper a model for interaction and asynchronous, concurrent communication, where each agent's <em>perception of the system</em> 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.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"93 1","pages":"Pages 114-171"},"PeriodicalIF":1.0000,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0890540191900546","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
We 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.
期刊介绍：
Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as
-Biological computation and computational biology-
Computational complexity-
Computer theorem-proving-
Concurrency and distributed process theory-
Cryptographic theory-
Data base theory-
Decision problems in logic-
Design and analysis of algorithms-
Discrete optimization and mathematical programming-
Inductive inference and learning theory-
Logic & constraint programming-
Program verification & model checking-
Probabilistic & Quantum computation-
Semantics of programming languages-
Symbolic computation, lambda calculus, and rewriting systems-
Types and typechecking
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
