Contextual equivalence for higher-order pi-calculus revisited
Contextual equivalence for higher-order pi-calculus revisited
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.
Jeffrey, Alan
d79c647d-86f4-43f2-94d0-78be65748331
Rathke, Julian
dba0b571-545c-4c31-9aec-5f70c231774b
April 2005
Jeffrey, Alan
d79c647d-86f4-43f2-94d0-78be65748331
Rathke, Julian
dba0b571-545c-4c31-9aec-5f70c231774b
Jeffrey, Alan and Rathke, Julian
(2005)
Contextual equivalence for higher-order pi-calculus revisited.
Logical Methods in Computer Science, 1 (1).
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.
More information
Published date: April 2005
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 263368
URI: http://eprints.soton.ac.uk/id/eprint/263368
PURE UUID: a9658c04-ea69-4137-ac39-958bf6683b20
Catalogue record
Date deposited: 01 Feb 2007
Last modified: 14 Mar 2024 07:31
Export record
Contributors
Author:
Alan Jeffrey
Author:
Julian Rathke
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics