The buffered π-calculus: A model for concurrent languages
文献类型：会议论文
| 作者 | Deng, Xiaojie (1) ; Zhang, Yu (2) ; Deng, Yuxin (1) ; Zhong, Farong (3) |
| 出版日期 | 2013 |
| 会议名称 | 7th International Conference on Language and Automata Theory and Applications, LATA 2013 |
| 会议日期 | April 2, 2013 - April 5, 2013 |
| 会议地点 | Bilbao, Spain |
| 页码 | 250-261 |
| 通讯作者 | Deng, X. |
| 中文摘要 | Message-passing based concurrent languages are widely used in developing large distributed and coordination systems. This paper presents the buffered π-calculus - a variant of the π-calculus where channel names are classified into buffered and unbuffered: communication along buffered channels is asynchronous, and remains synchronous along unbuffered channels. We show that the buffered π-calculus can be fully simulated in the polyadic π-calculus with respect to strong bisimulation. In contrast to the π-calculus which is hard to use in practice, the new language enables easy and clear modeling of practical concurrent languages. We encode two real-world concurrent languages in the buffered π-calculus: the (core) Go language and the Core Erlang. Both encodings are fully abstract with respect to weak bisimulations. © 2013 Springer-Verlag Berlin Heidelberg. |
| 英文摘要 | Message-passing based concurrent languages are widely used in developing large distributed and coordination systems. This paper presents the buffered π-calculus - a variant of the π-calculus where channel names are classified into buffered and unbuffered: communication along buffered channels is asynchronous, and remains synchronous along unbuffered channels. We show that the buffered π-calculus can be fully simulated in the polyadic π-calculus with respect to strong bisimulation. In contrast to the π-calculus which is hard to use in practice, the new language enables easy and clear modeling of practical concurrent languages. We encode two real-world concurrent languages in the buffered π-calculus: the (core) Go language and the Core Erlang. Both encodings are fully abstract with respect to weak bisimulations. © 2013 Springer-Verlag Berlin Heidelberg. |
| 收录类别 | EI |
| 会议录出版地 | Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany |
| 语种 | 英语 |
| ISSN号 | 3029743 |
| ISBN号 | 9783642370632 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16656]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Deng, Xiaojie ,Zhang, Yu ,Deng, Yuxin ,et al. The buffered π-calculus: A model for concurrent languages[C]. 见:7th International Conference on Language and Automata Theory and Applications, LATA 2013. Bilbao, Spain. April 2, 2013 - April 5, 2013. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。