Comparison of process algebra equivalences

V.C. Galpin

Seminar, Department of Computer Science, University of the Witwatersrand, October 1999


Process algebras present simple and elegant models of concurrency where processes with the same behaviour are identified by semantic equivalences. A question of interest is how different semantic equivalences are related. In this seminar, an approach to this comparison using the metatheory of formats will be presented. A new format, the extended tyft/tyxt format will be presented and results will be given on how different equivalences can be compared. 

The material will be presented informally, with an introduction to process algebras, and a discussion of the format and the comparison results. The aim is to give a flavour of how it is posible to reason about process algebra equivalences. 

Slides - PDF