Locality and Polyadicity in Asynchronous Name-Passing Calculi Export

@incollection{citeulike:6014033, abstract = {We give a divergence-free encoding of polyadic Local π into its monadic variant. Local π is a sub-calculus of asynchronous π-calculus where the recipients of a channel are local to the process that has created the channel. We prove the encoding fully-abstract with respect to barbed congruence. This implies that in Local π (i) polyadicity does not add extra expressive power, and (ii) when studying the theory of polyadic Local π we can focus on the simpler monadic variant. Then, we show how the idea of our encoding can be adapted to name-passing calculi with non-binding input prefix, such as Chi, Fusion and πF calculi.}, author = {Merro, Massimo}, citeulike-article-id = {6014033}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-46432-8_16}, citeulike-linkout-1 = {http://www.springerlink.com/content/udmwl1fckafdpdfa}, doi = {10.1007/3-540-46432-8_16}, journal = {Foundations of Software Science and Computation Structures}, keywords = {concurrency, picalculus}, pages = {238--251}, posted-at = {2009-10-27 03:49:28}, priority = {2}, title = {Locality and Polyadicity in Asynchronous Name-Passing Calculi}, url = {http://dx.doi.org/10.1007/3-540-46432-8_16}, year = {2000} }

TY - CHAP ID - citeulike:6014033 L3 - citeulike-article-id:6014033 N2 - We give a divergence-free encoding of polyadic Local π into its monadic variant. Local π is a sub-calculus of asynchronous π-calculus where the recipients of a channel are local to the process that has created the channel. We prove the encoding fully-abstract with respect to barbed congruence. This implies that in Local π (i) polyadicity does not add extra expressive power, and (ii) when studying the theory of polyadic Local π we can focus on the simpler monadic variant. Then, we show how the idea of our encoding can be adapted to name-passing calculi with non-binding input prefix, such as Chi, Fusion and πF calculi. JF - Foundations of Software Science and Computation Structures EP - 251 TI - Locality and Polyadicity in Asynchronous Name-Passing Calculi SP - 238 KW - concurrency KW - picalculus AU - Merro, Massimo PY - 2000/// UR - http://dx.doi.org/10.1007/3-540-46432-8_16 ER -