Department of Computer Science and Technology

Technical reports

Categories of models for concurrency

Glynn Winskel

October 1984, 35 pages

DOI: 10.48456/tr-58

Abstract

It is shown how a variety of models for concurrent processes can be viewed as categories in which familiar constructions turn out to be significant categorically. Constructions to represent various parallel compositions are often based on a product construction, for instance. In many cases different models can be related by a pair of functors forming an adjunction between the two categories. Because of the way in which such pairs of functors preserve categorical constructions, the adjunction serves to translate between the different models, so it is seen how semantics expressed in terms of one model translate to semantics in terms of another.

Full text

PDF (1.3 MB)

BibTeX record

@TechReport{UCAM-CL-TR-58,
  author =	 {Winskel, Glynn},
  title = 	 {{Categories of models for concurrency}},
  year = 	 1984,
  month = 	 oct,
  url = 	 {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-58.pdf},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-58},
  number = 	 {UCAM-CL-TR-58}
}