Models for Concurrency

Glynn Winskel and Mogens Nielsen

May 1994


This report surveys a range of models for parallel computation to include interleaving models like transition systems, synchronisation trees and languages (often called Hoare traces in this context), and models like Petri nets, asynchronous transition systems, event structures, pomsets and Mazurkiewicz traces where concurrency is represented more explicitly by a form of causal independence. The presentation is unified by casting the models in a category-theoretic framework. One aim is to use category theory to provide abstract characterisations of constructions like parallel composition valid throughout a range of different models and to provide formal means for translating between different models.

A knowledge of basic category theory is assumed, up to an acquaintance with the notion of adjunction.

Available as hardcopy only.


Last modified: 2003-06-08 by webmaster.