Skip to main content
Springer Nature Link
Log in

Different Glasses to Look into the Three Cs: Component, Connector, Coordination

  • Chapter
  • First Online:
Models, Languages, and Tools for Concurrent and Distributed Programming

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

  • 789 Accesses

Abstract

Component, connector, and coordination have been key concepts exploited in different communities to manage the complexity of concurrent and distributed system development. In this paper, we discuss three approaches within three different classes: composition in software architectures, coordination models, and programming abstractions for concurrency. These classes encompass different perspectives and solutions to face crucial challenges in developing concurrent and distributed systems. The approaches are discussed with respect to some characteristics of interest for the above classes: compositionality, incrementality, scalability, compositional reasoning, reusability, and evolution.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
USD 12.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    www.w3.org/TR/wsdl.

  2. 2.

    https://www.programmableweb.com.

References

  1. Allen, R.: A formal approach to software architecture. Ph.D. thesis, Carnegie Mellon, School of Computer Science, January 1997. Issued as CMU Technical Report CMU-CS-97-144

    Google Scholar 

  2. Allen, R., Garlan, D.: A formal basis for architectural connection. ACM Trans. Softw. Eng. Methodol. 6(3), 213–249 (1997)

    Article  Google Scholar 

  3. Arbab, F.: What do you mean, coordination? Bulletin of the Dutch Association for Theoretical Computer Science (NVTI), 19 March 1998

    Google Scholar 

  4. Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329–366 (2004)

    Article  MathSciNet  Google Scholar 

  5. Arbab, F.: Abstract behavior types: a foundation model for components and their composition. Sci. Comput. Program. 55(1–3), 3–52 (2005)

    Article  MathSciNet  Google Scholar 

  6. Arbab, F.: Puff, the magic protocol. In: Agha, G., Danvy, O., Meseguer, J. (eds.) Formal Modeling: Actors, Open Systems, Biological Systems. LNCS, vol. 7000, pp. 169–206. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24933-4_9

    Chapter  Google Scholar 

  7. Arbab, F.: Proper protocol. In: Ábrahám, E., Bonsangue, M., Johnsen, E.B. (eds.) Theory and Practice of Formal Methods. LNCS, vol. 9660, pp. 65–87. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30734-3_7

    Chapter  Google Scholar 

  8. Arbab, F., Aştefănoaei, L., de Boer, F.S., Dastani, M., Meyer, J.-J., Tinnermeier, N.: Reo connectors as coordination artifacts in 2APL systems. In: Bui, T.D., Ho, T.V., Ha, Q.-T. (eds.) PRIMA 2008. LNCS (LNAI), vol. 5357, pp. 42–53. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89674-6_8

    Chapter  Google Scholar 

  9. Arbab, F., Chothia, T., Meng, S., Moon, Y.-J.: Component connectors with QoS guarantees. In: Murphy and Vitek [84], pp. 286–304

    Google Scholar 

  10. Arbab, F., Chothia, T., van der Mei, R., Meng, S., Moon, Y.-J., Verhoef, C.: From coordination to stochastic models of QoS. In: Field and Vasconcelos [49], pp. 268–287

    Google Scholar 

  11. Arbab, F., Kokash, N., Meng, S.: Towards using Reo for compliance-aware business process modeling. In: Margaria, T., Steffen, B. (eds.) ISoLA 2008. CCIS, vol. 17, pp. 108–123. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88479-8_9

    Chapter  Google Scholar 

  12. Arbab, F., Meng, S.: Synthesis of connectors from scenario-based interaction specifications. In: Chaudron, M.R.V., Szyperski, C., Reussner, R. (eds.) CBSE 2008. LNCS, vol. 5282, pp. 114–129. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87891-9_8

    Chapter  Google Scholar 

  13. Arbab, F., Meng, S., Moon, Y.-J., Kwiatkowska, M.Z., Qu, H.: Reo2MC: a tool chain for performance analysis of coordination models. In: van Vliet, H., Issarny, V. (eds.) ESEC/SIGSOFT FSE, pp. 287–288. ACM (2009)

    Google Scholar 

  14. Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2002. LNCS, vol. 2755, pp. 34–55. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-40020-2_2

    Chapter  Google Scholar 

  15. Arvind, A., Gostelow, K.P., Plouffe, W.: Indeterminancy, monitors, and dataflow. In: Rosen, S., Denning, P.J. (eds.) Proceedings of the Sixth Symposium on Operating System Principles, SOSP 1977, Purdue University, West Lafayette, Indiana, USA, 16–18 November 1977, pp. 159–169. ACM (1977)

    Google Scholar 

  16. Attie, P., Baranov, E., Bliudze, S., Jaber, M., Sifakis, J.: A general framework for architecture composability. In: Giannakopoulou, D., Salaün, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 128–143. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10431-7_10

    Chapter  Google Scholar 

  17. Autili, M., Chilton, C., Inverardi, P., Kwiatkowska, M., Tivoli, M.: Towards a connector algebra. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6416, pp. 278–292. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16561-0_28

    Chapter  Google Scholar 

  18. Autili, M., Inverardi, P., Tivoli, M.: Choreography realizability enforcement through the automatic synthesis of distributed coordination delegates. Sci. Comput. Program. 160, 3–29 (2018)

    Article  Google Scholar 

  19. Autili, M., Salle, A.D., Gallo, F., Pompilio, C., Tivoli, M.: On the model-driven synthesis of evolvable service choreographies. In: Proceedings of the 12th European Conference on Software Architecture: Companion Proceedings, ECSA 2018, Madrid, Spain, 24–28 September 2018, pp. 20:1–20:6 (2018)

    Google Scholar 

  20. Baier, C., Blechmann, T., Klein, J., Klüppelholz, S.: Formal verification for components and connectors. In: de Boer, F.S., Bonsangue, M.M., Madelaine, E. (eds.) FMCO 2008. LNCS, vol. 5751, pp. 82–101. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04167-9_5

    Chapter  MATH  Google Scholar 

  21. Baier, C., Blechmann, T., Klein, J., Klüppelholz, S.: A uniform framework for modeling and verifying components and connectors. In: Field and Vasconcelos [49], pp. 247–267

    Google Scholar 

  22. Baier, C., Blechmann, T., Klein, J., Klüppelholz, S., Leister, W.: Design and verification of systems with exogenous coordination using Vereofy. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6416, pp. 97–111. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16561-0_15

    Chapter  Google Scholar 

  23. Baier, C., Klein, J., Klüppelholz, S.: Modeling and verification of components and connectors. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol. 6659, pp. 114–147. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21455-4_4

    Chapter  Google Scholar 

  24. Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2), 75–113 (2006)

    Article  MathSciNet  Google Scholar 

  25. Baier, C., Wolf, V.: Stochastic reasoning about channel-based component connectors. In: Ciancarini, P., Wiklicky, H. (eds.) COORDINATION 2006. LNCS, vol. 4038, pp. 1–15. Springer, Heidelberg (2006). https://doi.org/10.1007/11767954_1

    Chapter  Google Scholar 

  26. Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: SEFM 2006: Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods, Washington, DC, USA, pp. 3–12. IEEE Computer Society (2006)

    Google Scholar 

  27. Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: Proceedings of SEFM 2006, pp. 3–12. IEEE (2006)

    Google Scholar 

  28. Basu, S., Bultan, T.: Automated choreography repair. In: Stevens, P., Wąsowski, A. (eds.) FASE 2016. LNCS, vol. 9633, pp. 13–30. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49665-7_2

    Chapter  Google Scholar 

  29. Basu, S., Bultan, T., Ouederni, M.: Deciding choreography realizability. In: POPL. ACM (2012)

    Google Scholar 

  30. Benveniste, A., Caspi, P., Le Guernic, P., Halbwachs, N.: Data-flow synchronous languages. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 1–45. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58043-3_16

    Chapter  Google Scholar 

  31. Berry, G.: Esterel and Jazz: two synchronous languages for circuit design (abstract). In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, p. 1. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48153-2_1

    Chapter  Google Scholar 

  32. Bhaduri, P., Ramesh, S.: Interface synthesis and protocol conversion. Form. Asp. Comput. 20(2), 205–224 (2008)

    Article  Google Scholar 

  33. Bidinger, P., Schmitt, A., Stefani, J.-B.: An abstract machine for the Kell calculus. In: Steffen, M., Zavattaro, G. (eds.) FMOODS 2005. LNCS, vol. 3535, pp. 31–46. Springer, Heidelberg (2005). https://doi.org/10.1007/11494881_3

    Chapter  Google Scholar 

  34. Bidinger, P., Stefani, J.-B.: The Kell calculus: operational semantics and type system. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 109–123. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39958-2_8

    Chapter  Google Scholar 

  35. Blechmann, T., Baier, C.: Checking equivalence for Reo networks. Electr. Notes Theor. Comput. Sci 215, 209–226 (2008)

    Article  Google Scholar 

  36. Bliudze, S., Sifakis, J.: The algebra of connectors - structuring interaction in BIP. IEEE Trans. Comput. 57(10), 1315–1330 (2008)

    Article  MathSciNet  Google Scholar 

  37. Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. Theor. Comput. Sci. 366(1), 98–120 (2006)

    Article  MathSciNet  Google Scholar 

  38. Buck, J.T., Ha, S., Lee, E.A., Messerschmitt, D.G.: Ptolemy: a framework for simulating and prototyping heterogenous systems. Int. J. Comput. Simul. 4(2), 155–182 (1994)

    Google Scholar 

  39. Carriero, N., Gelernter, D.: A computational model of everything. Commun. ACM 44(11), 77–81 (2001)

    Article  Google Scholar 

  40. Caspi, P., Pilaud, D., Halbwachs, N., Plaice, J.: LUSTRE: a declarative language for programming synchronous systems. In: Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, Munich, Germany, 21–23 January 1987, pp. 178–188. ACM Press (1987)

    Google Scholar 

  41. Clarke, D.: A basic logic for reasoning about connector reconfiguration. Fundam. Inform. 82(4), 361–390 (2008)

    MathSciNet  MATH  Google Scholar 

  42. Clarke, D., Costa, D., Arbab, F.: Modelling coordination in biological systems. In: Margaria, T., Steffen, B. (eds.) ISoLA 2004. LNCS, vol. 4313, pp. 9–25. Springer, Heidelberg (2006). https://doi.org/10.1007/11925040_2

    Chapter  Google Scholar 

  43. de Alfaro, L., Henzinger, T.A.: Interface automata. SIGSOFT Softw. Eng. Notes 26(5), 109–120 (2001)

    Article  Google Scholar 

  44. Dennis, J.B., Gao, G.R.: An efficient pipelined dataflow processor architecture. In: Michael, G.A. (ed.) Proceedings Supercomputing 1988, Orlando, FL, USA, 12–17 November 1988, pp. 368–373. IEEE Computer Society (1988)

    Google Scholar 

  45. Dokter, K., Arbab. F.: Treo: textual syntax for Reo connectors. In: Bliudze, S., Bensalem, S. (eds.) Proceedings of the 1st International Workshop on Methods and Tools for Rigorous System Design, MeTRiD@ETAPS 2018. EPTCS, Thessaloniki, Greece, 15th April 2018, vol. 272, pp. 121–135 (2018)

    Article  Google Scholar 

  46. Dokter, K., Jongmans, S., Arbab, F., Bliudze, S.: Combine and conquer: relating BIP and Reo. J. Log. Algebr. Meth. Program. 86(1), 134–156 (2017)

    Article  MathSciNet  Google Scholar 

  47. Fiadeiro, J.L., Lopes, A., Wermelinger, M.: A mathematical semantics for architectural connectors. In: Generic Programming, pp. 178–221 (2003)

    Chapter  Google Scholar 

  48. Gautier, T., Le Guernic, P., Besnard, L.: SIGNAL: a declarative language for synchronous programming of real-time systems. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol. 274, pp. 257–277. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-18317-5_15

    Chapter  Google Scholar 

  49. Hirsch, D., Uchitel, S., Yankelevich, D.: Towards a periodic table of connectors. In: Ciancarini, P., Wolf, A.L. (eds.) COORDINATION 1999. LNCS, vol. 1594, p. 418. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48919-3_32

    Chapter  Google Scholar 

  50. Honda, K., Mukhamedov, A., Brown, G., Chen, T.-C., Yoshida, N.: Scribbling interactions with a formal foundation. In: Natarajan, R., Ojo, A. (eds.) ICDCIT 2011. LNCS, vol. 6536, pp. 55–75. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19056-8_4

    Chapter  Google Scholar 

  51. Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: Necula, G.C., Wadler, P. (eds.) Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, 7–12 January 2008, pp. 273–284. ACM (2008)

    Google Scholar 

  52. Inverardi, P., Tivoli, M.: Automatic synthesis of modular connectors via composition of protocol mediation patterns. In: 35th International Conference on Software Engineering, ICSE 2013, San Francisco, CA, USA, 18–26 May 2013, pp. 3–12 (2013)

    Google Scholar 

  53. Jongmans, S.-S., Halle, S., Arbab, F.: Reo: a dataflow inspired language for multicore. In: Proceedings of DFM 2013, pp. 42–50. IEEE (2014)

    Google Scholar 

  54. Jongmans, S.-S.T.: Automata-theoretic protocol programming: parallel computation, threads and their interaction, optimized compilation, [at a] high level of abstraction. Ph.D. thesis, Leiden University (2015, submitted)

    Google Scholar 

  55. Jongmans, S.-S.T., Arbab, F.: Overview of thirty semantic formalisms for Reo. Sci. Ann. Comput. Sci. 22(1), 201–251 (2013)

    MathSciNet  MATH  Google Scholar 

  56. Kahn, G.: The semantics of a simple language for parallel programming. In: Rosenfeld, J.L. (ed.) Information Processing, Stockholm, Sweden, pp. 471–475. North Holland, Amsterdam, August 1974

    Google Scholar 

  57. Kahn, G., MacQueen, D.B.: Coroutines and networks of parallel processes. In: IFIP Congress, pp. 993–998 (1977)

    Google Scholar 

  58. Kemper, S.: SAT-based verification for timed component connectors. Electr. Notes Theor. Comput. Sci. 255, 103–118 (2009)

    Article  Google Scholar 

  59. Kemper, S.: Compositional construction of real-time dataflow networks. In: Clarke, D., Agha, G. (eds.) COORDINATION 2010. LNCS, vol. 6116, pp. 92–106. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13414-2_7

    Chapter  Google Scholar 

  60. Klein, J., Klüppelholz, S., Stam, A., Baier, C.: Hierarchical modeling and formal verification. An industrial case study using Reo and Vereofy. In: Salaün, G., Schätz, B. (eds.) FMICS 2011. LNCS, vol. 6959, pp. 228–243. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24431-5_17

    Chapter  Google Scholar 

  61. Klüppelholz, S., Baier, C.: Symbolic model checking for channel-based component connectors. Electr. Notes Theor. Comput. Sci 175(2), 19–37 (2007)

    Article  Google Scholar 

  62. Koehler, C., Arbab, F., de Vink, E.: Reconfiguring distributed Reo connectors. In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS, vol. 5486, pp. 221–235. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03429-9_15

    Chapter  Google Scholar 

  63. Koehler, C., Costa, D., Proença, J., Arbab, F.: Reconfiguration of Reo connectors triggered by dataflow. In: Ermel, C., Heckel, R., de Lara, J. (eds.) Proceedings of the 7th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2008), vol. 10, pp. 1–13 (2008). ECEASST. ISSN 1863-2122. http://www.easst.org/eceasst/

  64. Koehler, C., Lazovik, A., Arbab, F.: ReoService: coordination modeling tool. In: Krämer et al. [72], pp. 625–626

    Google Scholar 

  65. Kokash, N., Arbab, F.: Formal behavioral modeling and compliance analysis for service-oriented systems. In: de Boer, F.S., Bonsangue, M.M., Madelaine, E. (eds.) FMCO 2008. LNCS, vol. 5751, pp. 21–41. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04167-9_2

    Chapter  Google Scholar 

  66. Kokash, N., Arbab, F.: Formal design and verification of long-running transactions with extensible coordination tools. IEEE Trans. Serv. Comput. 6(2), 186–200 (2013)

    Article  Google Scholar 

  67. Kokash, N., Krause, C., de Vink, E.: Data-aware design and verification of service compositions with Reo and mCRL2. In: SAC 2010: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 2406–2413. ACM, New York (2010)

    Google Scholar 

  68. Kokash, N., Krause, C., de Vink, E.P.: Verification of context-dependent channel-based service models. In: de Boer, F.S., Bonsangue, M.M., Hallerstede, S., Leuschel, M. (eds.) FMCO 2009. LNCS, vol. 6286, pp. 21–40. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17071-3_2

    Chapter  Google Scholar 

  69. Kokash, N., Krause, C., de Vink, E.P.: Time and data-aware analysis of graphical service models in Reo. In: Fiadeiro, J.L., Gnesi, S., Maggiolo-Schettini, A. (eds.) SEFM, pp. 125–134. IEEE Computer Society (2010)

    Google Scholar 

  70. Krause, C.: Reconfigurable component connectors. Ph.D. thesis, Leiden University (2011). https://openaccess.leidenuniv.nl/handle/1887/17718

  71. Krause, C., Maraikar, Z., Lazovik, A., Arbab, F.: Modeling dynamic reconfigurations in Reo using high-level replacement systems. Sci. Comput. Program. 76(1), 23–36 (2011)

    Article  Google Scholar 

  72. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)

    Article  Google Scholar 

  73. Lazovik, A., Arbab, F.: Using Reo for service coordination. In: Krämer et al. [72], pp. 398–403

    Chapter  Google Scholar 

  74. Liu, X., Xiong, Y., Lee, E.A.: The Ptolemy II framework for visual languages. In: 2002 IEEE CS International Symposium on Human-Centric Computing Languages and Environments (HCC 2001), Stresa, Italy, 5–7 September 2001, p. 50. IEEE Computer Society (2001)

    Google Scholar 

  75. Lopes, A., Wermelinger, M., Fiadeiro, J.L.: Higher-order architectural connectors. ACM Trans. Softw. Eng. Methodol. 12(1), 64–104 (2003)

    Article  Google Scholar 

  76. Manikas, K., Hansen, K.M.: Software ecosystems - a systematic literature review. J. Syst. Softw. 86(5), 1294–1306 (2013)

    Article  Google Scholar 

  77. Milner, R.: A Calculus of Communicating Systems. Springer, New York (1982)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  79. Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press, New York (2009)

    Book  Google Scholar 

  80. Moon, Y.-J., Silva, A., Krause, C., Arbab, F.: A compositional semantics for stochastic Reo connectors. In: Mousavi, M.R., Salaün, G. (eds.) FOCLASA. EPTCS, vol. 30, pp. 93–107 (2010)

    Article  Google Scholar 

  81. Ng, N., de Figueiredo Coutinho, J.G., Yoshida, N.: Protocols by default - safe MPI code generation based on session types. In: Franke, B. (ed.) CC 2015. LNCS, vol. 9031, pp. 212–232. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46663-6_11

    Chapter  Google Scholar 

  82. Ng, N., Yoshida, N.: Pabble: parameterised scribble for parallel programming. In: 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2014, Torino, Italy, 2–14 February 2014, pp. 707–714. IEEE Computer Society (2014)

    Google Scholar 

  83. Nicola, R.D., Duong, T., Inverso, O., Trubiani, C.: AErlang: empowering Erlang with attribute-based communication. Sci. Comput. Program. 168, 71–93 (2018)

    Article  Google Scholar 

  84. De Nicola, R., Loreti, M., Pugliese, R., Tiezzi, F.: A formal approach to autonomic systems programming: the SCEL language. ACM Trans. Auton. Adapt. Syst. 9(2), 7:1–7:29 (2014)

    Article  Google Scholar 

  85. Papadopoulos, G.A., Arbab, F.: Coordination models and languages. Adv. Comput. 46, 329–400 (1998)

    Article  Google Scholar 

  86. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall Inc., New York (1998)

    Google Scholar 

  87. Schmitt, A., Stefani, J.-B.: The Kell calculus: a family of higher-order distributed process calculi. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol. 3267, pp. 146–178. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31794-4_9

    Chapter  Google Scholar 

  88. Schumm, D., Turetken, O., Kokash, N., Elgammal, A., Leymann, F., van den Heuvel, W.-J.: Business process compliance through reusable units of compliant processes. In: Daniel, F., Facca, F.M. (eds.) ICWE 2010. LNCS, vol. 6385, pp. 325–337. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16985-4_29

    Chapter  Google Scholar 

  89. Sifakis, J.: A framework for component-based construction extended abstract. In: SEFM 2005: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, Washington, DC, USA, pp. 293–300. IEEE Computer Society (2005)

    Google Scholar 

  90. Stefani, J.-B.: A calculus of Kells. Electr. Notes Theor. Comput. Sci. 85(1), 40–60 (2003)

    Article  Google Scholar 

  91. Yoshida, N., Hu, R., Neykova, R., Ng, N.: The scribble protocol language. In: Abadi, M., Lluch Lafuente, A. (eds.) TGC 2013. LNCS, vol. 8358, pp. 22–41. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05119-2_3

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centrum Wiskunde & Informatica, Science Park 123, 1098 XG, Amsterdam, The Netherlands

    Farhad Arbab

  2. Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, L’Aquila, Italy

    Marco Autili, Paola Inverardi & Massimo Tivoli

Authors
  1. Farhad Arbab
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Autili
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paola Inverardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Massimo Tivoli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Massimo Tivoli .

Editor information

Editors and Affiliations

  1. Department of Statistics, Computer Science, Applications, University of Florence, Florence, Italy

    Michele Boreale

  2. School of Science and Technology, University of Camerino, Camerino, Italy

    Flavio Corradini

  3. School of Science and Technology, University of Camerino, Camerino, Italy

    Michele Loreti

  4. Department of Statistics, Computer Science, Applications, University of Florence, Florence, Italy

    Rosario Pugliese

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

Arbab, F., Autili, M., Inverardi, P., Tivoli, M. (2019). Different Glasses to Look into the Three Cs: Component, Connector, Coordination. In: Boreale, M., Corradini, F., Loreti, M., Pugliese, R. (eds) Models, Languages, and Tools for Concurrent and Distributed Programming. Lecture Notes in Computer Science(), vol 11665. Springer, Cham. https://doi.org/10.1007/978-3-030-21485-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-21485-2_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-21484-5

  • Online ISBN: 978-3-030-21485-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics