The Saga of the Axiomatization of Parallel Composition

Luca Aceto
Anna Ingólfsdóttir

June 2007


This paper surveys some classic and recent results on the finite axiomatizability of bisimilarity over CCS-like languages. It focuses, in particular, on non-finite axiomatizability results stemming from the semantic interplay between parallel composition and nondeterministic choice. The paper also highlights the role that auxiliary operators, such as Bergstra and Klop's left and communication merge and Hennessy's merge operator, play in the search for a finite, equational axiomatization of parallel composition both for classic process algebras and for their real-time extensions

Available as PostScript, PDF, DVI.


Last modified: 2007-07-05 by webmaster.