(Context-Sensitivity In) Reo, Revisited

  • Sung-Shik T. Q. JongmansEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10231)


Coordination languages emerged for programming interaction protocols among components in component-based systems, in terms of connectors. One such language is Reo. Reo facilitates compositional construction of complex composite connectors out of simple primitive ones. Unlike the behavior of connectors in other coordination languages, the behavior of a connector in Reo may depend on whether its coordinated components are ready for Open image in new window . Such behavior is called “context-sensitivity”, and its formalization—a nontrivial problem—has received considerable attention from the community. In this paper, I study three common and historically significant primitives in Reo—context-sensitive LossySync, FIFOn, and LossyFIFOn—and prove that they have inconsistent informal semantics. Moreover, four major formal semantics of Reo do not correspond with its foremost alternative informal semantics.


Source Node Data Item Sink Node Boundary Node Formal Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



I thank Farhad Arbab for his constructive comments on the results in this paper, which helped me improve their presentation. I also thank the anonymous reviewers for their very helpful comments.


  1. 1.
    Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comp. Sci. 14(3), 329–366 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Arbab, F.: Abstract behavior types: a foundation model for components and their composition. Sci. Comput. Program. 55(1–3), 3–52 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Arbab, F., Mavaddat, F.: Coordination through channel composition. In: Arbab, F., Talcott, C. (eds.) COORDINATION 2002. LNCS, vol. 2315, pp. 22–39. Springer, Heidelberg (2002). doi: 10.1007/3-540-46000-4_6 CrossRefGoogle Scholar
  4. 4.
    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). doi: 10.1007/978-3-540-40020-2_2 CrossRefGoogle Scholar
  5. 5.
    Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2), 75–113 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Bonsangue, M., Clarke, D., Silva, A.: A model of context-dependent component connectors. Sci. Comput. Program. 77(66), 685–706 (2012)CrossRefzbMATHGoogle Scholar
  7. 7.
    Clarke, D., Costa, D., Arbab, F.: Connector colouring I: synchronisation and context dependency. Sci. Comput. Program. 66(3), 205–225 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Costa, D.: Formal models for component connectors. Ph.D. thesis, Vrije Universiteit Amsterdam (2010)Google Scholar
  9. 9.
    Jongmans, S.-S.T.Q., Krause, C., Arbab, F.: Encoding context-sensitivity in Reo into non-context-sensitive semantic models. In: Meuter, W., Roman, G.-C. (eds.) COORDINATION 2011. LNCS, vol. 6721, pp. 31–48. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-21464-6_3 CrossRefGoogle Scholar
  10. 10.
    Koehler, C., Clarke, D.: Decomposing port automata. In: Proceedings of SAC 2009, pp. 1369–1373. ACM (2009)Google Scholar
  11. 11.
    Mousavi, M.R., Sirjani, M., Arbab, F.: Specification, simulation, and verification of component connectors in Reo. Technical report CSR-0415, Eindhoven University of Technology (2004)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.School of Computer ScienceOpen University of the NetherlandsHeerlenThe Netherlands
  2. 2.Institute for Computing and Information SciencesRadboud University NijmegenNijmegenThe Netherlands

Personalised recommendations