Contextual equivalence for higher-order pi-calculus revisited
Abstract
The higher-order pi-calculus is an extension of the pi-calculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence for higher-order pi-calculus is provided using labelled transition systems and normal bisimulations. Unfortunately the proof technique used there requires a restriction of the language to only allow finite types. We revisit this calculus and offer an alternative presentation of the labelled transition system and a novel proof technique which allows us to provide a fully abstract characterisation of contextual equivalence using labelled transitions and bisimulations for higher-order pi-calculus with recursive types also.
@TechReport\{jeffrey.rathke:contextual-equivalence,
author = \{A. Jeffrey and J. Rathke},
title = \{Contextual equivalence for higher-order pi-calculus revisited},
institution = \{{COGS},University of Sussex},
year = \{2002},
number = \{2002:04},
url = \{http://mikado.di.fc.ul.pt/repository/jeffrey.rathke_contextual-equivalence.pdf}
}
About this site. Last modified: Fri Apr 26 06:38:46 CEST 2024