A fully abstract domain model for the π-calculus

I. Stark

doi:10.1109/LICS.1996.561301

A fully abstract domain model for the π-calculus

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

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)

Original language	English
Title of host publication	Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
Publisher	Institute of Electrical and Electronics Engineers
Pages	36-42
Number of pages	7
DOIs	https://doi.org/10.1109/LICS.1996.561301
Publication status	Published - 1 Jul 1996

Access to Document

10.1109/LICS.1996.561301

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=561301

Cite this

@inproceedings{be5debb5756545a48445817b92f0d7f3,

title = "A fully abstract domain model for the π-calculus",

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)",

author = "I. Stark",

year = "1996",

month = jul,

day = "1",

doi = "10.1109/LICS.1996.561301",

language = "English",

pages = "36--42",

booktitle = "Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

}

TY - GEN

T1 - A fully abstract domain model for the π-calculus

AU - Stark, I.

PY - 1996/7/1

Y1 - 1996/7/1

N2 - 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)

AB - 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)

U2 - 10.1109/LICS.1996.561301

DO - 10.1109/LICS.1996.561301

M3 - Conference contribution

SP - 36

EP - 42

BT - Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on

PB - Institute of Electrical and Electronics Engineers

ER -

A fully abstract domain model for the π-calculus

Abstract / Description of output

Access to Document

Fingerprint

Cite this