Title :
A fully abstract domain model for the π-calculus
Author_Institution :
Dept. of Comput. Sci., Aarhus Univ., Denmark
Abstract :
Abramsky´s domain equation for bisimulation and the author´s categorical models for names combine to give a domain-theoretic model for the π-calculus. This is set in a functor category which provides a syntax-free interpretation of fresh names, privacy visibility and non-interference between processes. The model is fully abstract for strong late bisimilarity and equivalence (bisimilarity under all name substitutions)
Keywords :
calculus of communicating systems; category theory; computation theory; equivalence classes; π-calculus; abstract domain model; bisimulation; categorical models; domain-theoretic model; equivalence; fresh names; functor category; non-interference; privacy visibility; strong late bisimilarity; syntax-free interpretation; Concrete; Equations; Lead; Tensile stress;
Conference_Titel :
Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
Conference_Location :
New Brunswick, NJ
Print_ISBN :
0-8186-7463-6
DOI :
10.1109/LICS.1996.561301
