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 03043975

Full text not available from this repository.

Abstract

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
Depositing User: Matthew Hennessy
Date Deposited: 06 Feb 2012 21:07
Last Modified: 14 Jun 2012 08:27
URI: http://sro.sussex.ac.uk/id/eprint/29631
📧 Request an update