A fully abstract denotational semantics for the π-calculus

Hennessy, Matthew (2002) A fully abstract denotational semantics for the π-calculus. Theoretical Computer Science, 278 (1-2). pp. 53-89. ISSN 0304-3975

Download (364kB) | Preview


This paper describes the construction of two set-theoretic denotational models for the π-calculus. The models are obtained as initial solutions to domain equations in a functor category. By associating with each syntactic construct of the π-calculus a natural transformation over these models we obtain two interpretations for the language. We also show that these models are fully abstract with respect to natural behavioural preorders over terms in the language. By this we mean that two terms are related behaviourally if and only if their interpretations in the model are related. The behavioural preorders are the standard versions of may and must testing adapted to the π-calculus.

Item Type: Article
Schools and Departments: School of Engineering and Informatics > Informatics
Subjects: Q Science > QA Mathematics > QA0075 Electronic computers. Computer science
Depositing User: Chris Keene
Date Deposited: 27 Feb 2008
Last Modified: 21 Oct 2019 09:12
URI: http://sro.sussex.ac.uk/id/eprint/1388
Google Scholar:47 Citations

View download statistics for this item

📧 Request an update