Contextual equivalence for higher-order pi-calculus revisited


Jeffrey, Alan and Rathke, Julian (2005) Contextual equivalence for higher-order pi-calculus revisited Logical Methods in Computer Science, 1, (1)

Download

[img] PDF hopi.pdf - Other
Restricted to Registered users only

Download (172kB)

Description/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.

Item Type: Article
Related URLs:
Organisations: Electronic & Software Systems
ePrint ID: 263368
Date :
Date Event
April 2005Published
Date Deposited: 01 Feb 2007
Last Modified: 17 Apr 2017 19:54
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/263368

Actions (login required)

View Item View Item