具有公平合并和完全递归的并发模型

IF 1 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Information and Computation Pub Date : 1991-07-01 Epub Date: 2004-11-29 DOI:10.1016/0890-5401(91)90054-6

Yiannis N. Moschovakis

{"title":"具有公平合并和完全递归的并发模型","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":"{\"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\":\"2004/11/29 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","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":"2004/11/29 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

本文介绍了一个用于交互和异步并发通信的模型，其中每个智能体对系统的感知用一个交互博弈来表示。该模型结合了（严格）公平合并和完全递归，主要的数学结果为非确定性过程递归定义的新解释的鲁棒性和自然性提供了证据。我们的概念方法最接近Park，他的想法是这项工作的起点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A model of concurrency with fair merge and full recursion

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 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： 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