A Theory of Recursive Domains with Applications to Concurrency

Gian Luca Cattani, Marcelo Fiore and Glynn Winskel

In Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, LICS '98, pages 214--225. IEEE Computer Society Press, 1998.

Available as DVI (46k) or postscript (86k).

Abstract

We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on order-theoretic structures to category-theoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf models for concurrent process calculi. Further, we use the framework to study (open-map) bisimulation.

@InProceedings{cattani/fiore/winskel:therdac,
author=       {Cattani, Gian Luca and Fiore, Marcelo and Winskel, Glynn},
title=        {A Theory of Recursive Domains with Applications to Concurrency},
booktitle =   {Proceedings of the Thirteenth Annual IEEE Symposium on Logic 
               in Computer Science, LICS'98},  
pages =       {214--225},
year =        1998,
organization= {IEEE Computer Society Press},
url =         {ftp.cl.cam.ac.uk/users/glc25/therdac.ps.gz}
}