Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Theoretical Aspects of Computing

ICTAC 2016: Theoretical Aspects of Computing – ICTAC 2016 pp 139–157Cite as

On the Expressiveness of Symmetric Communication

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9965))

Abstract

The expressiveness of communication primitives has been explored in a common framework based on the \(\pi \)-calculus by considering four features: synchronism, arity, communication medium, and pattern-matching. These all assume asymmetric communication between input and output primitives, however some calculi consider more symmetric approaches to communication such as fusion calculus and Concurrent Pattern Calculus. Symmetry can be considered either as supporting exchange of information between an action and co-action, or as unification of actions. By means of possibility/impossibility of encodings, this paper shows that the exchange approach is related to, or more expressive than, many previously considered languages. Meanwhile, the unification approach is more expressive than some, but mostly unrelated to, other languages.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Log. Methods Comput. Sci. 7(1) (2011)

    Google Scholar 

  2. Bengtson, J., Parrow, J.: Formalising the pi-calculus using nominal logic. Log. Methods Comput. Sci. 5(2) (2009)

    Google Scholar 

  3. Boudol, G.: Notes on algebraic calculi of processes. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems, pp. 261–303. Springer, New York (1985)

    Google Scholar 

  4. Busi, N., Gorrieri, R., Zavattaro, G.: On the expressiveness of Linda coordination primitives. Inf. Comput. 156(1–2), 90–121 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in \(\pi \)-calculus. Nordic J. Comput. 10(2), 70–98 (2003)

    MathSciNet  MATH  Google Scholar 

  6. de Boer, F.S., Palamidessi, C.: Concurrent logic programming: asynchronism and language comparison. In: Proceedings of the 1990 North American Conference on Logic Programming, pp. 175–194. MIT Press, Cambridge (1990)

    Google Scholar 

  7. de Boer, F.S., Palamidessi, C.: Embedding as a tool for language comparison. Inf. Comput. 108(1), 128–157 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fournet, C., Gonthier, G.: The reflexive cham and the join-calculus. In: Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pp. 372–385. ACM Press (1996)

    Google Scholar 

  9. Gelernter, D.: Generative communication in Linda. ACM Trans. Program. Lang. Syst. 7(1), 80–112 (1985)

    Article  MATH  Google Scholar 

  10. Given-Wilson, T.: Concurrent Pattern Unification. Ph.D. thesis, University of Technology, Sydney, Australia (2012)

    Google Scholar 

  11. Given-Wilson, T.: An intensional concurrent faithful encoding of Turing machines. In: Proceedings of the ICE 2014, Berlin, Germany, 6 June 2014, pp. 21–37 (2014)

    Google Scholar 

  12. Given-Wilson, T.: On the expressiveness of intensional communication. In: Proceedings of EXPRESS/SOS, Rome, Italie, September 2014

    Google Scholar 

  13. Given-Wilson, T., Gorla, D.: Pattern matching and bisimulation. In: Nicola, R., Julien, C. (eds.) COORDINATION 2013. LNCS, vol. 7890, pp. 60–74. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38493-6_5

    Chapter  Google Scholar 

  14. Given-Wilson, T., Gorla, D., Jay, B.: A concurrent pattern calculus. Log. Methods Comput. Sci. 10(3) (2014)

    Google Scholar 

  15. Given-Wilson, T., Legay, A.: On the expressiveness of joining. In: ICE 2015, Grenoble, France, June 2015

    Google Scholar 

  16. Gorla, D.: Comparing communication primitives via their relative expressive power. Inf. Comput. 206(8), 931–952 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gorla, D.: A taxonomy of process calculi for distribution and mobility. Distrib. Comput. 23(4), 273–299 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  18. Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Inf. Comput. 208(9), 1031–1053 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  19. Jay, B.: Pattern Calculus: Computing with Functions and Data Structures. Springer, Heidelberg (2009)

    Book  MATH  Google Scholar 

  20. Jay, B., Given-Wilson, T.: A combinatory account of internal structure. J. Symbol. Logic 76(3), 807–826 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Lanese, I., Pérez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness of polyadic and synchronous communication in higher-order process calculi. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 442–453. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14162-1_37

    Chapter  Google Scholar 

  22. Lanese, I., Vaz, C., Ferreira, C.: On the expressive power of primitives for compensation handling. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 366–386. Springer, Heidelberg (2010). doi:10.1007/978-3-642-11957-6_20

    Chapter  Google Scholar 

  23. Milner, R.: The polyadic \(\pi \)-calculus: a tutorial. In: Logic and Algebra of Specification, vol. 94. Series F. NATO ASI, 203–246. Springer, Heidelberg (1993)

    Google Scholar 

  24. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes I & II. Inf. Comput. 100(1), 1–77 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  25. Nielsen, L., Yoshida, N., Honda, K.: Multiparty symmetric sum types. In: Proceedings of EXPRESS, pp. 121–135 (2010)

    Google Scholar 

  26. Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Math. Struct. Comp. Sci. 13(5), 685–719 (2003)

    Article  MathSciNet  Google Scholar 

  27. Parrow, J.: Expressiveness of process algebras. Electron. Not. Theoret. Comput. Sci. 209, 173–186 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  28. Parrow, J., Victor, B.: The fusion calculus: expressiveness and symmetry in mobile processes. In: Proceedings of 13th Annual IEEE Symposium on Logic in Computer Science, pp. 176–185, June 1998

    Google Scholar 

  29. Peters, K.: Translational expressiveness: comparing process calculi using encodings. Ph.D. thesis, Technische Universität Berlin, Fakultät IV, Germany (2012)

    Google Scholar 

  30. Shapiro, E.: Separating concurrent languages with categories of language embeddings. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 198–208. ACM, New York (1991)

    Google Scholar 

  31. van Glabbeek, R.J.: Musings on encodings and expressiveness. In: Proceedings of EXPRESS/SOS. EPTCS, vol. 89, pp. 81–98 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inria, Rennes, France

    Thomas Given-Wilson & Axel Legay

Authors
  1. Thomas Given-Wilson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Axel Legay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Given-Wilson .

Editor information

Editors and Affiliations

  1. Universidade Federal de Pernambuco Centro de Informática, Recife, Pernambuco, Brazil

    Augusto Sampaio

  2. Deptartment of Electrical Engineering BL, National Taiwan University, Taipei, Taiwan

    Farn Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Given-Wilson, T., Legay, A. (2016). On the Expressiveness of Symmetric Communication. In: Sampaio, A., Wang, F. (eds) Theoretical Aspects of Computing – ICTAC 2016. ICTAC 2016. Lecture Notes in Computer Science(), vol 9965. Springer, Cham. https://doi.org/10.1007/978-3-319-46750-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46750-4_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46749-8

  • Online ISBN: 978-3-319-46750-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation