Comparing the expressive power of the synchronous and the asynchronous pi-calculus (1997) [107 citations — 9 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Palamidessi97comparingthe,author = {Catuscia Palamidessi},
title = {Comparing the expressive power of the synchronous and the asynchronous pi-calculus},
booktitle = {Mathematical Structures in Computer Science},
year = {1997},
pages = {256--265},
publisher = {ACM}
}
Years of Citing Articles
Abstract:
The Asynchronous ��-calculus, as recently proposed by Boudol and, independently, by Honda and Tokoro, is a subset of the ��-calculus which contains no explicit operators for choice and output-prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output-prefixing, as shown by Boudol, and input-guarded choice, as shown recently by Nestmann and Pierce. A natural question arises, then, whether or not it is possible to embed in it the full ��-calculus. We show that this is not possible, i.e. there does not exist any uniform, parallel-preserving, translation from the ��-calculus into the asynchronous ��-calculus, up to any "reasonable " notion of equivalence. This result is based on the incapablity of the asynchronous ��-calculus of breaking certain symmetries possibly present in the initial communication graph. By similar arguments, we prove a separation result between the ��-calculus and CCS.
Citations
| 82 | On bisimulations for the asynchronous ��-calculus – Amadio, Castellani, et al. - 1996 |
| 9 | Process algebra with asynchronous communication mechanisms – Bergstra, Klop, et al. |
