A Semantic Model for Service Composition with Coordination Time Delays

  • Natallia Kokash
  • Behnaz Changizi
  • Farhad Arbab
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6447)


The correct behavior of a service composition depends on the appropriate coordination of its services. According to the idea of channel-based coordination, services exchange messages though channels without any knowledge about each other. The Reo coordination language aims at building connectors out of basic channels to implement arbitrarily complex interaction protocols. The activity within a Reo connector consists of two types of communication, each of which incurs a delay: internal coordination and data transfer. Semantic models have been proposed for Reo that articulate data transfer delays, but none of them explicitly considers coordination delays. More importantly, these models implicitly assume that (1) internal coordination and data transfer activities take place in two separate phases, and (2) data transfer delays do not affect the coordination phase. This assumptions prevent maximal concurrency in data exchange and distort the evaluation of end-to-end delays in service composition models. In this paper, we introduce a novel compositional automata-based semantic model for Reo that explicitly represents both internal coordination and data transfer aspects in channel-based connectors. Furthermore, we map the proposed model to the process algebra mCRL2 , which allows us to generate state spaces for connectors with time delays and analyze them automatically.


Service Composition Semantic Model Label Transition System Internal Coordination Source Port 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arbab, F.: Reo: A channel-based coordination model for component composition. Mathematical Structures in Computer Science 14, 329–366 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling Component Connectors in Reo by Constraint Automata. Science of Computer Programming 61, 75–113 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Arbab, F., Chothia, T., Sun, M., Moon, Y.J.: Component connectors with QoS guarantees. In: Murphy, A.L., Vitek, J. (eds.) COORDINATION 2007. LNCS, vol. 4467, pp. 286–304. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Arbab, F., Chothia, T., van der Mei, R., Sun, M., Moon, Y., Verhoef, C.: From coordination to stochastic models of QoS. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol. 5521, pp. 268–287. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Kokash, N., Krause, C., de Vink, E.: Verification of context-dependent channel-based service models. In: de Boer, F.S. (ed.) FMCO 2009. LNCS, vol. 6286, pp. 21–40. Springer, Heidelberg (2010)Google Scholar
  6. 6.
    Chothia, T., Kleijn, J.: Q-automata: Modelling the resource usage of concurrent components. In: Proc. FOCLASA 2006, pp. 79–94 (2007)Google Scholar
  7. 7.
    Kokash, N., Krause, C., de Vink, E.: Data-aware design and verification of service composition with Reo and mCRL2. In: Proc. of SAC 2010, pp. 2406–2413. ACM Press, New York (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Natallia Kokash
    • 1
  • Behnaz Changizi
    • 1
  • Farhad Arbab
    • 1
  1. 1.CWIAmsterdamThe Netherlands

Personalised recommendations