The buffered &pi;-calculus: A model for concurrent languages

ISCAS OpenIR

	The buffered π-calculus: A model for concurrent languages
	Deng, Xiaojie (1); Zhang, Yu (2); Deng, Yuxin (1); Zhong, Farong (3); Deng, X.
	2013
会议名称	7th International Conference on Language and Automata Theory and Applications, LATA 2013
页码	250-261
会议日期	April 2, 2013 - April 5, 2013
会议地点	Bilbao, Spain
收录类别	EI
出版地	Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany
ISSN	3029743
ISBN	9783642370632
部门归属	(1) BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China; (2) State Key Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (3) Department of Computer Science, Zhejiang Normal University, Zhejiang, China
摘要	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.
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16656
专题	中国科学院软件研究所
通讯作者	Deng, X.
推荐引用方式 GB/T 7714	Deng, Xiaojie ,Zhang, Yu ,Deng, Yuxin ,et al. The buffered π-calculus: A model for concurrent languages[C]. Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany,2013:250-261.