On the Relative Expressive Power of Asynchronous Communication Primitives

In this paper, we study eight asynchronous communication primitives, arising from the combination of three features: arity (monadic vs polyadic data), communication medium (message passing vs shared dataspaces) and pattern-matching. Each primitive has been already used in at least one language appeared in literature; however, to uniformly reason on such primitives, we plugged them in a common framework inspired by the asynchronous π-calculus. By means of possibility/impossibility of ‘reasonable' encodings, we compare every pair of primitives to obtain a hierarchy of languages based on their relative expressive power.

[1]  Flemming Nielson,et al.  From Flow Logic to Static Type Systems for Coordination Languages , 2010, COORDINATION.

[2]  Ehud Shapiro,et al.  Separating concurrent languages with categories of language embeddings , 1991, STOC '91.

[3]  R. Nicola,et al.  Semantic subtyping for the π-calculus , 2004 .

[4]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and the asynchronous π-calculus , 1998, POPL '97.

[5]  Tobin J. Lehman,et al.  T Spaces , 1998, IBM Syst. J..

[6]  Pierre America,et al.  ECOOP'91 European Conference on Object-Oriented Programming , 1991, Lecture Notes in Computer Science.

[7]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

[8]  Roberto Gorrieri,et al.  A Process Algebraic View of Linda Coordination Primitives , 1998, Theor. Comput. Sci..

[9]  Ravi S. Sandhu,et al.  Role-Based Access Control Models , 1996, Computer.

[10]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, HLCL.

[11]  V. Sassone,et al.  A distributed calculus for role-based access control , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..

[12]  Sergio Maffeis,et al.  On the Expressive Power of Polyadic Synchronisation in pi-calculus , 2002, EXPRESS.

[13]  Nobuko Yoshida,et al.  Graph Types for Monadic Mobile Processes , 1996, FSTTCS.

[14]  G. Erard Boudol.  Asynchrony and the -calculus (note) , 1992 .

[15]  D. Walker,et al.  A Calculus of Mobile Processes, Part I , 1989 .

[16]  David Walker,et al.  On Encoding p-pi in m-pi , 1998, FSTTCS.

[17]  Frank S. de Boer,et al.  Embedding as a Tool for Language Comparison , 1994, Inf. Comput..

[18]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 1999 .

[19]  Robin Milner.  An Action Structure for Synchronous pi-Calculus , 1993, FCT.

[20]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

[21]  Rocco De Nicola,et al.  On the expressive power of KLAIM-based calculi , 2005, Theor. Comput. Sci..

[22]  Daniele Gorla,et al.  Security Policies as Membranes in Systems for Global Computing , 2005, Log. Methods Comput. Sci..

[23]  Joachim Parrow,et al.  An Introduction to the π-Calculus , 2001, Handbook of Process Algebra.

[24]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and asynchronous $pi$-calculi , 2003, Mathematical Structures in Computer Science.

[25]  Daniele Gorla,et al.  Towards a unified approach to encodability and separation results for process calculi , 2008, Inf. Comput..

[26]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[27]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[28]  Ninghui Li,et al.  Beyond proof-of-compliance: security analysis in trust management , 2005, JACM.

[29]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[30]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[31]  Daniele Gorla.  Comparing Calculi for Mobility via their Relative Expressive Power , 2008 .

[32]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[33]  Rocco De Nicola,et al.  KLAIM: A Kernel Language for Agents Interaction and Mobility , 1998, IEEE Trans. Software Eng..

[34]  Gianluigi Zavattaro,et al.  Towards a Hierarchy of Negative Test Operators for Generative Communication , 1998, EXPRESS.

[35]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[36]  Richard Bauckham.  Text-Books , 1904 .

[37]  Paola Quaglia,et al.  On Encoding p pi in m pi , 1998 .

[38]  Daniele Gorla,et al.  Inferring dynamic credentials for rôle-based trust management , 2006, PPDP '06.

[39]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[40]  Rocco De Nicola,et al.  Pattern Matching over a Dynamic Network of Tuple Spaces , 2005, FMOODS.

[41]  Rocco De Nicola,et al.  Global computing in a dynamic network of tuple spaces , 2007, Sci. Comput. Program..

[42]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[43]  Roberto Gorrieri,et al.  Comparing three semantics for Linda-like languages , 2000, Theor. Comput. Sci..

[44]  Z. Ésik,et al.  Research reports , 1977, Postgraduate medicine.

[45]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[46]  Joachim Parrow,et al.  An introduction to the pi-calculus , 2001 .

[47]  Roberto Gorrieri,et al.  On the Expressiveness of Linda Coordination Primitives , 2000, Inf. Comput..

[48]  Benjamin C. Pierce,et al.  Pict: a programming language based on the Pi-Calculus , 2000, Proof, Language, and Interaction.

[49]  Albert Benveniste,et al.  Compositionality in Dataflow Synchronous Languages: Specification and Distributed Code Generation , 2000, Inf. Comput..

[50]  Cosimo Laneve,et al.  PiDuce: A Process Calculus with Native XML Datatypes , 2005, EPEW/WS-FM.

[51]  Vianey Villamizar.  An Introduction to the Calculus , 1926, Nature.

[52]  Traian Muntean,et al.  Expressiveness of Point-to-Point versus Broadcast Communications , 1999, FCT.

[53]  Daniele Gorla,et al.  Controlling data movement in global computing applications , 2004, SAC '04.

[54]  Lucia Acciai,et al.  XPi: A Typed Process Calculus for XML Messaging , 2005, FMOODS.

[55]  W. F. Osgood.  Introduction to the calculus , 1922 .

[56]  Taylor Yu.  The Kerberos Network Authentication Service (Version 5) , 2007 .

[57]  Maurice Herlihy,et al.  Impossibility and universality results for wait-free synchronization , 1988, PODC '88.

[58]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[59]  Daniele Varacca,et al.  Semantic subtyping for the /spl pi/-calculus , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[60]  Ken Arnold,et al.  JavaSpaces¿ Principles, Patterns, and Practice , 1999 .

[61]  Mario Bravetti,et al.  Formal Techniques for Computer Systems and Business Processes, European Performance Engineering Workshop, EPEW 2005 and International Workshop on Web Services and Formal Methods, WS-FM 2005, Versailles, France, September 1-3, 2005, Proceedings , 2005, EPEW/WS-FM.

[62]  Rocco De Nicola,et al.  Basic observables for a calculus for global computing , 2007, Inf. Comput..

[63]  Daniele Gorla.  Synchrony vs Asynchrony in Communication Primitives , 2006, EXPRESS.