A Fully Abstract Model for the [pi]-calculus Export

@article{citeulike:558091, abstract = {This paper provides both a fully abstract (domain-theoretic) model for the [pi]-calculus and a universal (set-theoretic) model for the finite [pi]-calculus with respect to strong late bisimulation and congruence. This is done by considering categorical models, defining a metalanguage for these models, and translating the [pi]-calculus into the metalanguage. A technical novelty of our approach is an abstract proof of full abstraction: The result on full abstraction for the finite [pi]-calculus in the set-theoretic model is axiomatically extended to the whole [pi]-calculus with respect to the domain-theoretic interpretation. In this proof, a central role is played by the description of nondeterminism as a free construction and by the equational theory of the metalanguage.}, author = {Fiore, M. P. and Moggi, E. and Sangiorgi, D.}, citeulike-article-id = {558091}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=767300.767303}, citeulike-linkout-1 = {http://dx.doi.org/10.1006/inco.2002.2968}, citeulike-linkout-2 = {http://www.sciencedirect.com/science/article/B6WGK-475YXCV-3/2/f07c6ef1ffe48baf15e3e92a2c9a7f79}, day = {25}, doi = {10.1006/inco.2002.2968}, journal = {Information and Computation}, keywords = {denotationalsemantics, picalculus}, month = {November}, number = {1}, pages = {76--117}, posted-at = {2006-11-10 08:43:15}, priority = {2}, title = {A Fully Abstract Model for the [pi]-calculus}, url = {http://dx.doi.org/10.1006/inco.2002.2968}, volume = {179}, year = {2002} }

TY - JOUR ID - citeulike:558091 L3 - citeulike-article-id:558091 N2 - This paper provides both a fully abstract (domain-theoretic) model for the [pi]-calculus and a universal (set-theoretic) model for the finite [pi]-calculus with respect to strong late bisimulation and congruence. This is done by considering categorical models, defining a metalanguage for these models, and translating the [pi]-calculus into the metalanguage. A technical novelty of our approach is an abstract proof of full abstraction: The result on full abstraction for the finite [pi]-calculus in the set-theoretic model is axiomatically extended to the whole [pi]-calculus with respect to the domain-theoretic interpretation. In this proof, a central role is played by the description of nondeterminism as a free construction and by the equational theory of the metalanguage. IS - 1 JF - Information and Computation EP - 117 TI - A Fully Abstract Model for the [pi]-calculus VL - 179 SP - 76 KW - denotationalsemantics KW - picalculus AU - Fiore, MP AU - Moggi, E AU - Sangiorgi, D PY - 2002/11/25/ UR - http://dx.doi.org/10.1006/inco.2002.2968 ER -