@inproceedings{80b38a6292fc4fe9b7ad8003c1ace08b,
title = "The buffered π-calculus: A model for concurrent languages",
abstract = "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.",
keywords = "formal model, full abstraction, process calculus",
author = "Xiaojie Deng and Yu Zhang and Yuxin Deng and Farong Zhong",
year = "2013",
doi = "10.1007/978-3-642-37064-9\_23",
language = "英语",
isbn = "9783642370632",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "250--261",
booktitle = "Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Proceedings",
address = "德国",
note = "7th International Conference on Language and Automata Theory and Applications, LATA 2013 ; Conference date: 02-04-2013 Through 05-04-2013",
}