Skip to main content
SpringerLink
Log in
Book cover

Models, Mindsets, Meta: The What, the How, and the Why Not? pp 326–355Cite as

On the Expressiveness of Joining and Splitting

  • Chapter
  • First Online:

  • 431 Accesses

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

Abstract

An ongoing theme of the work of Bernhard Steffen has been the bringing together of different components in a coordinated manner and with a unified language. This paper explores this approach applied to process calculi that account for coordination of different kinds of workflows. Coordination here extends binary interaction to also account for joining of multiple outputs into a single input, and splitting from a single output to multiple inputs. The results here formalise which process calculi can and cannot be encoded into one another, and thus which language has the required expressiveness for given workflow properties. The combination of with other features of interaction allows for the representation of many systems and workflows in an appropriate calculus.

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. Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the spi calculus. In: Proceedings of the 4th ACM Conference on Computer and Communications Security, CCS 1997, pp. 36–47. ACM, New York (1997)

    Google Scholar 

  2. 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 

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

    Google Scholar 

  4. Bocchi, L., Wischik, L.: A process calculus of atomic commit. Electron. Notes Theor. Comput. Sci. 105, 119–132 (2004). Proceedings of the First International Workshop on Web Services and Formal Methods (WSFM 2004)

    Article  MATH  Google Scholar 

  5. Boreale, M., Fournet, C., Laneve, C.: Bisimulations in the Join-Calculus. In: Gries, D., de Roever, W.-P. (eds.) Programming Concepts and Methods PROCOMET ’98. ITIFIP, pp. 68–86. Springer, Boston, MA (1998). https://doi.org/10.1007/978-0-387-35358-6_9

    Chapter  Google Scholar 

  6. Boudol, G.: Notes on algebraic calculi of processes. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems. NATO ASI Series (Series F: Computer and Systems Sciences), vol. 13, pp. 261–303. Springer, Heidelberg (1985). https://doi.org/10.1007/978-3-642-82453-1_9

    Chapter  Google Scholar 

  7. Boudol, G.: Asynchrony and the pi-calculus. Rapport de Recherche 1702 (1992)

    Google Scholar 

  8. Burkart, O., Caucal, D., Steffen, B.: Bisimulation collapse and the process taxonomy. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 247–262. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61604-7_59

    Chapter  Google Scholar 

  9. 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 

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

    MathSciNet  MATH  Google Scholar 

  11. Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FoSSaCS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0053547

    Chapter  Google Scholar 

  12. Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B.: A succinct canonical register automaton model. J. Log. Algebr. Meth. Program. 84(1), 54–66 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  13. Castagna, G., De Nicola, R., Varacca, D.: Semantic subtyping for the pi-calculus. Theor. Comput. Sci. 398(1–3), 217–242 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. de Lara, J., Zisman, A. (eds.): FASE 2012. LNCS, vol. 7212. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28872-2

    Book  Google Scholar 

  15. De Nicola, R., Ferrari, G.L., Pugliese, R.: KLAIM: a kernel language for agents interaction and mobility. IEEE Trans. Softw. Eng. 24(5), 315–330 (1998)

    Article  Google Scholar 

  16. De Nicola, R., Gorla, D., Pugliese, R.: On the expressive power of Klaim-based calculi. Theor. Comput. Sci. 356(3), 387–421 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. de Simone, R.: Higher-level synchronising devices in Meije-SCCS. Theor. Comput. Sci. 37, 245–267 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  18. Ene, C., Muntean, T.: A broadcast-based calculus for communicating systems. In: International Parallel and Distributed Processing Symposium, vol. 3, p. 30149b. IEEE Computer Society (2001)

    Google Scholar 

  19. 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 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

  22. Given-Wilson, T.: An intensional concurrent faithful encoding of turing machines. In: Lanese, I., Lluch-Lafuente, A., Sokolova, A., Vieira, H.T. (eds.) Proceedings 7th Interaction and Concurrency Experience, ICE 2014, Berlin, Germany, 6th June 2014. EPTCS, vol. 166, pp. 21–37 (2014)

    Google Scholar 

  23. Given-Wilson, T.: On the expressiveness of intensional communication. In: Combined 21th International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, Rome, Italie, September 2014

    Google Scholar 

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

    Chapter  Google Scholar 

  25. Given-Wilson, T., Gorla, D., Jay, B.: Concurrent pattern calculus. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IAICT, vol. 323, pp. 244–258. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15240-5_18

    Chapter  Google Scholar 

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

    Google Scholar 

  27. Given-Wilson, T., Legay, A.: On the expressiveness of joining. In: 8th Interaction and Concurrency Experience (ICE 2015), Grenoble, France, June 2015

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  30. 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 

  31. Haack, C., Jeffrey, A.: Pattern-matching spi-calculus. Inf. Comput. 204(8), 1195–1263 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  32. Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991). https://doi.org/10.1007/BFb0057019

    Chapter  Google Scholar 

  33. Honda, K., Yoshida, N.: On reduction-based process semantics. Theor. Comput. Sci. 152, 437–486 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  34. 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). https://doi.org/10.1007/978-3-642-14162-1_37

    Chapter  MATH  Google Scholar 

  35. 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). https://doi.org/10.1007/978-3-642-11957-6_20

    Chapter  Google Scholar 

  36. Laneve, C., Vitale, A.: The expressive power of synchronizations. In: 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 382–391. IEEE (2010)

    Google Scholar 

  37. Margaria, T., Steffen, B.: Middleware: just another level for orchestration. In: Proceedings of the Workshop on Middleware for Next-Generation Converged Networks and Applications, MNCNA 2007, Newport Beach, California, USA, 26 November 2007, p. 4. ACM (2007)

    Google Scholar 

  38. Milner, R.: The polyadic \({\pi }\)-calculus: a tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. NATO ASI Series (Series F: Computer & Systems Sciences), vol. 94, pp. 203–246. Springer, Heidelberg (1993). https://doi.org/10.1007/978-3-642-58041-3_6

    Chapter  Google Scholar 

  39. Milner, R.: Communicating and Mobile Systems - the Pi-Calculus. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  42. Naujokat, S., Lamprecht, A., Steffen, B.: Tailoring process synthesis to domain characteristics. In: Perseil, I., Breitman, K.K., Sterritt, R. (eds.) 16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011, Las Vegas, Nevada, USA, 27–29 April 2011, pp. 167–175. IEEE Computer Society (2011)

    Google Scholar 

  43. Nestmann, U.: On the expressive power of joint input. Electron. Notes Theor. Comput. Sci. 16(2), 145–152 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  44. Neubauer, J., Steffen, B.: Plug-and-play higher-order process integration. IEEE Comput. 46(11), 56–62 (2013)

    Article  Google Scholar 

  45. Neubauer, J., Steffen, B., Margaria, T.: Higher-order process modeling: product-lining, variability modeling and beyond. In: Banerjee, A., Danvy, O., Doh, K., Hatcliff, J. (eds.) Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday, Manhattan, Kansas, USA, 19–20th September 2013. EPTCS, vol. 129, pp. 259–283 (2013)

    Google Scholar 

  46. Nielsen, L., Yoshida, N., Honda, K.: Multiparty symmetric sum types. In: Proceedings of the 17th International Workshop on Expressiveness in Concurrency (EXPRESS 2010), pp. 121–135 (2010)

    Article  Google Scholar 

  47. Nielson, H.R., Nielson, F., Vigo, R.: A calculus for quality. In: Păsăreanu, C.S., Salaün, G. (eds.) FACS 2012. LNCS, vol. 7684, pp. 188–204. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-35861-6_12

    Chapter  Google Scholar 

  48. Nielson, H.R., Nielson, F., Vigo, R.: A calculus of quality for robustness against unreliable communication. J. Log. Algebr. Methods Program. 84(5), 611–639 (2015)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  50. Parrow, J.: Expressiveness of process algebras. Electron. Notes Theor. Comput. Sci. 209, 173–186 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  52. Peters, K., Nestmann, U., Goltz, U.: On distributability in process calculi. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 310–329. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37036-6_18

    Chapter  Google Scholar 

  53. Prasad, K.V.: A calculus of broadcasting systems. Sci. Comput. Program. 25(2), 285–327 (1995)

    Article  MathSciNet  Google Scholar 

  54. Schmitt, A., Stefani, J.: The M-calculus: a higher-order distributed process calculus. In: Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New Orleans, Louisisana, USA, 15–17 January 2003, pp. 50–61 (2003)

    Google Scholar 

  55. Steffen, B.: Unifying models. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 1–20. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0023444

    Chapter  Google Scholar 

  56. Urban, C., Berghofer, S., Norrish, M.: Barendregt’s variable convention in rule inductions. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 35–50. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73595-3_4

    Chapter  Google Scholar 

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

    Google Scholar 

  58. van Glabbeek, R.J.: On the validity of encodings of the synchronous in the asynchronous \(\pi \)-calculus. Inf. Process. Lett. 137, 17–25 (2018)

    Article  MathSciNet  MATH  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. Lero–The Irish Software Research Center, University of Limerick, Limerick, Ireland

    Tiziana Margaria

  2. Verimag Laboratory, Grenoble, France

    Susanne Graf

  3. Aalborg University, Aalborg, Denmark

    Kim G. Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Given-Wilson, T., Legay, A. (2019). On the Expressiveness of Joining and Splitting. In: Margaria, T., Graf, S., Larsen, K. (eds) Models, Mindsets, Meta: The What, the How, and the Why Not?. Lecture Notes in Computer Science(), vol 11200. Springer, Cham. https://doi.org/10.1007/978-3-030-22348-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22348-9_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22347-2

  • Online ISBN: 978-3-030-22348-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation