Hostname: page-component-8448b6f56d-cfpbc Total loading time: 0 Render date: 2024-04-24T06:30:20.646Z Has data issue: false hasContentIssue false
  • English
  • Français

A filter model for mobile processes

Published online by Cambridge University Press:  01 February 1999

FERRUCCIO DAMIANI ,
MARIANGIOLA DEZANI-CIANCAGLINI  and
PAOLA GIANNINI
FERRUCCIO DAMIANI
Affiliation:
Dipartimento di Informatica, Università di Torino Corso, Svizzera 185 – 10149 Torino Italy. E-mail: {damiani,dezani,giannini}@di.unito.it
MARIANGIOLA DEZANI-CIANCAGLINI
Affiliation:
Dipartimento di Informatica, Università di Torino Corso, Svizzera 185 – 10149 Torino Italy. E-mail: {damiani,dezani,giannini}@di.unito.it
PAOLA GIANNINI
Affiliation:
Dipartimento di Informatica, Università di Torino Corso, Svizzera 185 – 10149 Torino Italy. E-mail: {damiani,dezani,giannini}@di.unito.it
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper presents a filter model for π-calculus and shows its full abstraction with respect to a ‘may’ operational semantics. The model is introduced in the form of a type assignment system. Types are related by a preorder that mimics the operational behaviour of terms. A subject expansion theorem holds. Terms are interpreted as filters of types: this interpretation is compositional. The proof of full abstraction relies on a notion of realizability of types and on the construction of terms, which test when an arbitrary term has a fixed type.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 9 , Issue 1 , February 1999 , pp. 63 - 101
Copyright
1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This work was partly supported by NATO Grant HTECH.LG960875.