A new format for process algebras
V.C. Galpin
Seminar, LAAS-CNRS, Toulouse, December 1998
Abstract
Since the development of CCS (Calculus of Communicating Systems) and
other process algebras based on structured operational semantics, many
extensions to these process algebras have been proposed to model
different aspects of concurrent computation. It is important both
theoretically and practically to understand the relationships between
these process algebras and between the semantic equivalences that are
defined for them.
In this talk, I will first discuss a new format that I have developed
which is suitable to describe process algebras with non-atomic actions
(a feature of most of the extensions to CCS). I will give a brief
introduction to process algebras, and show why the new format ensures
that strong bisimulation is a congruence for any operator defined with
the format. I will present a number of extension results for the new
format which permit the comparison of different semantic equivalences
and briefly give an example of a comparison.
Finally, I will give a brief overview of how process algebras have been
used to show fault-tolerance and describe some potential further
research in this direction.
Slides - gzipped PostScript
Slides - PDF
Back to Seminars and Presentations page