Synchrony vs Asynchrony in Communication Primitives

Electronic Notes in Theoretical Computer Science

Volumn 175, Issue 3, 2007, Pages 87-108

  Gorla, Daniele ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Communication Primitives; Encodings; Expressiveness; Process Calculi

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTER PROGRAMMING; DATA ACQUISITION; PATTERN MATCHING;

COMMUNICATION PRIMITIVES; ENCODINGS; EXPRESSIVENESS; PROCESS CALCULI;

SYNCHRONIZATION;

EID: 34250309654     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.10.054     Document Type: Article

References (25)

1. Arun-Kumar S., and Hennessy M. An efficiency preorder for processes. Acta Informatica 29 8 (1992) 737-760
2. G. Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992
3. Brown A., Laneve C., and Meredith G. πduce: a process calculus with native XML datatypes. Proc. of 2nd Int. Workshop on Services and Formal Methods. LNCS volume 3670 (2005), Springer
4. Busi N., Gorrieri R., and Zavattaro G. A process algebraic view of Linda coordination primitives. Theoretical Computer Science 192 2 (1998) 167-199
5. Cacciagrano D., and Corradini F. On synchronous and asynchronous communication paradigms. Proc. of ICTCS'01. LNCS number 2202 (2001), Springer 256-268
6. Cacciagrano D., Corradini F., and Palamidessi C. Separation of synchronous and asynchronous communication via testing. Proc. of EXPRESS. ENTCS (2005) Elsevier
7. Cardelli L., and Gordon A.D. Mobile ambients. Theoretical Computer Science 240 1 (2000) 177-213
8. Castagna G., De Nicola R., and Varacca D. Semantic subtyping for the π-calculus. Proc. of LICS (2005), IEEE Computer Society 92-101
9. De Nicola R., Gorla D., and Pugliese R. On the expressive power of KLAIM-based calculi. Theoretical Computer Science 356 3 (2006) 387-421
10. De Nicola R., and Hennessy M. Testing equivalence for processes. Theoretical Computer Science 34 (1984) 83-133
11. Fournet C., and Gonthier G. The reflexive chemical abstract machine and the join-calculus. Proceedings of POPL '96 (Jan. 1996), ACM 372-385
12. Gelernter D. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems 7 1 (1985) 80-112
13. Gorla D. On the relative expressive power of asynchronous communication primitives. Proc. of FoSSaCS'06. LNCS volume 3921 (2006), Springer 47-62
14. Honda K., and Tokoro M. An object calculus for asynchronous communication. Proc. of ECOOP '91. LNCS volume 512 (1991), Springer 133-147
15. Milner R. Communication and Concurrency (1989), Prentice Hall
16. Milner R. The polyadic π-calculus: A tutorial. Logic and Algebra of Specification. Series F. NATO ASI volume 94 (1993), Springer
17. Milner R., Parrow J., and Walker J. A Calculus of Mobile Processes, I and II. Information and Computation 100 1 (1992) 1-40 41-77
18. Milner R., and Sangiorgi D. Barbed bisimulation. Proc. of ICALP '92. LNCS volume 623 (1992), Springer 685-695
19. Natarajan V., and Cleaveland R. Divergence and fair testing. Proc. of ICALP'95. LNCS volume 944 (1995), Springer 648-659
20. Palamidessi C. Comparing the expressive power of the synchronous and the asynchronous π-calculi. Mathematical Structures in Computer Science 13 5 (2003) 685-719
21. Parrow J. An introduction to the pi-calculus. Handbook of Process Algebra (2001), Elsevier Science 479-543
22. Pierce B.C., and Turner D.N. Pict: A programming language based on the pi-calculus. Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing (May 2000), MIT Press
23. Quaglia P., and Walker D. On synchronous and asynchronous mobile processes. Proceedings of FoSSaCS 2000. LNCS volume 1784 (2000), Springer 283-296
24. Sangiorgi D., and Milner R. The problem of "weak bisimulation up to". Proc. of CONCUR. LNCS volume 630 (1992), Springer 32-46
25. Tel G. Introduction to distributed algorithms (1995), Cambridge University Press