DocumentCode
2719812
Title
A fully abstract domain model for the π-calculus
Author
Stark, Ian
Author_Institution
Dept. of Comput. Sci., Aarhus Univ., Denmark
fYear
1996
fDate
27-30 Jul 1996
Firstpage
36
Lastpage
42
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
Conference_Location
New Brunswick, NJ
ISSN
1043-6871
Print_ISBN
0-8186-7463-6
Type
conf
DOI
10.1109/LICS.1996.561301
Filename
561301
Link To Document