Ian Stark

A Fully Abstract Domain Model for the π-Calculus

In Logic in Computer Science: Proceedings of the Eleventh Annual IEEE Symposium, New Brunswick, New Jersey, July 27–30, 1996, pages 36–42. IEEE Computer Society Press, 1996.

Fetch a preprint of the paper (PDF, 99k), the conference slides (PDF 81k), or visit the publisher's page for this paper. Go to other papers, or my home page.

There is also an earlier unpublished note on the same research: Outline of a Denotational Semantics for the π-Calculus, June 1995. This is less polished, but includes some details left out of the conference paper.


Abramsky's domain equation for bisimulation and the author's categorical models for names combine to give a domain-theoretic model for the π-calculus. This is set in a functor category which provides a syntax-free interpretation of fresh names, privacy, visibility and non-interference between processes. The model is fully abstract for strong late bisimilarity and equivalence (bisimilarity under all name substitutions).

  author =       {Ian Stark},
  title =        {A Fully Abstract Domain Model for the $\pi$-Calculus},
  booktitle =    {Proceedings of the Eleventh Annual IEEE Symposium on Logic
                  in Computer Science},
  pages =        {36--42},
  publisher =    {IEEE Computer Society Press},
  year =         1996,
  url =          {http://www.inf.ed.ac.uk/~stark/fuladm.html},
  pdf =          {http://www.inf.ed.ac.uk/~stark/fuladm.pdf}

This research was supported by: BRICS — Basic Research in Computer Science, a centre of the Danish National Research Foundation; a Marie Curie Fellowship within the European Community EuroFoCS network; and ESPRIT Basic Research Action CLICS-II.

Page last modified: Thursday 27 November 2008