Presheaf Models for the pi-Calculus

Abstract

Abs t rac t . Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle systems where the language of actions may change dynamically as a process evolves. The example is the ~r-calculus, a calculus for 'mobile processes' whose communication topology varies as channels are created and discarded. A denotational semantics is described for the 1r-calculus within an indexed category of profunctors; the model is fully abstract for bisimilarity, in the sense that bisimulation in the model, obtained from open maps, coincides with the usual bisimulation obtained from the operational semantics of the ~r-calculus. While attention is concentrated on the 'late' semantics of the ~r-calculus~ it is indicated how the 'early' and other variants can also be captured.

DOI: 10.1007/BFb0026984

Cite this paper

@inproceedings{Cattani1997PresheafMF, title={Presheaf Models for the pi-Calculus}, author={Gian Luca Cattani and Ian Stark and Glynn Winskel}, booktitle={Category Theory and Computer Science}, year={1997} }