Bisimulations for Asynchronous Mobile Processes

Bisimulations for Asynchronous Mobile Processes

Martin Hansen
Hans Hüttel
Josva Kleist

In 6th NWPT, pages 188-189

Abstract:

In this paper we consider Plain LAL, a mobile process calculus which differs from the -calculus in the sense that the communication of data values happens asynchronously. Previously, Honda and Tokoro, and Boudol have described so-called asynchronous -calculi. However, they have not studied the notion of equivalence within this setting. The surprising result is that in the presence of asynchrony, the open, late and early bisimulation equivalences coincide. As the equivalences are one and the same, this leads us to formulate an equational theory which is sound for finite terms of Plain LAL.

Comments
BRICS, Department of Mathematics and Computer Science, Aalborg University, Fredrik Bajersvej 7E, 9220 Aalborg Ĝ, Denmark. Email: hans@iesd.auc.dk.

Available as PostScript, DVI.

[BRICS symbol] BRICS WWW home page