eprintid: 285
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/02/85
datestamp: 2011-05-26 12:22:23
lastmod: 2011-07-11 14:36:25
status_changed: 2011-05-26 12:22:23
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Castagna, Giuseppe
creators_name: De Nicola, Rocco
creators_name: Varacca, Daniele
creators_id: 
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Semantic subtyping for the pi-calculus
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Concurrency; Pi-calculus; Types; Subtyping; Channels; Boolean type combinators
abstract: Subtyping relations for the π-calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to derive a subtyping relation. The type system we consider includes read-only and write-only channel types, as well as boolean combinations of types. A set-theoretic interpretation of types is provided, in which boolean combinations of types are interpreted as the corresponding set-theoretic operations. Subtyping is defined as inclusion of the interpretations. We prove decidability of the subtyping relation and sketch the subtyping algorithm.

In order to fully exploit the type system, we define a variant of the π-calculus where communication is subjected to pattern matching that performs dynamic typecase.
date: 2008
date_type: published
publication: Theoretical Computer Science
volume: 398
number: 1-3
publisher: Elsevier
pagerange: 217-242
id_number: 10.1016/j.tcs.2008.01.049
refereed: TRUE
issn: 0304-3975
official_url: http://www.sciencedirect.com/science/article/pii/S0304397508000698
citation:   Castagna, Giuseppe and De Nicola, Rocco and Varacca, Daniele  Semantic subtyping for the pi-calculus.  Theoretical Computer Science, 398 (1-3).  pp. 217-242.  ISSN 0304-3975      (2008)