On the asynchronous nature of the asynchronous π-calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2008

On the asynchronous nature of the asynchronous π-calculus

Abstract

We address the question of what kind of asynchronous com- munication is exactly modeled by the asynchronous pi-calculus (pi_a). To this purpose we define a calculus pi_B where channels are represented explicitly as special buffer processes. The base language for pi_B is the (synchronous) pi-calculus, except that ordinary processes communicate only via buffers. Then we compare this calculus with pi_a. It turns out that there is a strong correspondence between pi_a and pi_B in the case that buffers are bags: we can indeed encode each pi_a process into a strongly asynchronous bisimilar pi_B process, and each pi_B process into a weakly asynchronous bisimilar pi_a process. In case the buffers are queues or stacks, on the contrary, the correspondence does not hold. We show indeed that it is not possible to translate a stack or a queue into a weakly asynchronous bisimilar pi_a process. Actually, for stacks we show an even stronger result, namely that they cannot be encoded into weakly (asynchronous) bisimilar processes in a pi-calculus without mixed choice.
Fichier principal
Vignette du fichier
asynchronouspi.pdf (226.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00349226 , version 1 (25-12-2008)
inria-00349226 , version 2 (30-01-2010)

Identifiers

Cite

Romain Beauxis, Catuscia Palamidessi, Frank D. Valencia. On the asynchronous nature of the asynchronous π-calculus. Rocco De Nicola, Pierpaolo Degano, and José Meseguer. Concurrency, Graphs and Models, Springer, pp.473-492, 2008, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-68679-8_29⟩. ⟨inria-00349226v2⟩
167 View
184 Download

Altmetric

Share

Gmail Facebook X LinkedIn More