On the Representation of References in the pi-calculus
Résumé
The π-calculus has been advocated as a model to interpret, and give semantics to, languages with
higher-order features. Often these languages make use of forms of references (and hence viewing a
store as set of references). While translations of references in π-calculi (and CCS) have appeared,
the precision of such translations has not been fully investigated. In this paper we address this issue.
We focus on the asynchronous π-calculus (Aπ), where translations of references are simpler. We
first define π ref , an extension of Aπ with references and operators to manipulate them, and illustrate
examples of the subtleties of behavioural equivalence in π ref . We then consider a translation of
π ref into Aπ. References of π ref are mapped onto names of Aπ belonging to a dedicated "reference"
type. We show how the presence of reference names affects the definition of barbed congruence. We
establish full abstraction of the translation w.r.t. barbed congruence and barbed equivalence in the
two calculi. We investigate proof techniques for barbed equivalence in Aπ, based on two forms of
labelled bisimilarities. For one bisimilarity we derive both soundness and completeness; for another,
more efficient and involving an inductive ‘game’ on reference names, we derive soundness, leaving
completeness open. Finally, we discuss examples of uses of the bisimilarities.
Fichier principal
refapi_full.pdf (656.33 Ko)
Télécharger le fichier
cc-by.pdf (58.48 Ko)
Télécharger le fichier
lipics-logo-bw.pdf (13.42 Ko)
Télécharger le fichier
orcid.pdf (19.55 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)