Realizability Is Controllability

  • Niels Lohmann
  • Karsten Wolf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6194)


A choreography describes the interaction between services. It may be used for specification purposes, for instance serving as a contract in the design of an inter-organizational business process. Typically, not all describable interactions make sense which motivates the study of the realizability problem for a given choreography.

In this paper, we show that realizability can be traced back to the problem of controllability which asks whether a service has compatible partner processes. This way of thinking makes algorithms for controllability available for reasoning about realizability. In addition, it suggests alternative definitions for realizability. We discuss several proposals for defining realizability which differ in the degree of coverage of the specified interaction.


Asynchronous Communication Service Orchestration Message Sequence Chart Message Event Service Choreography 
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.
    Su, J., Bultan, T., Fu, X., Zhao, X.: Towards a theory of Web service choreographies. In: Dumas, M., Heckel, R. (eds.) WS-FM 2007. LNCS, vol. 4937, pp. 1–16. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Fu, X., Bultan, T., Su, J.: Conversation protocols: a formalism for specification and verification of reactive electronic services. Theor. Comput. Sci. 328(1-2), 19–37 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. IEEE Trans. Software Eng. 29(7), 623–633 (2003)CrossRefGoogle Scholar
  4. 4.
    Wolf, K.: Does my service have partners? In: Jensen, K., van der Aalst, W.M.P. (eds.) Transactions on Petri Nets, Part II. LNCS, vol. 5460, pp. 152–171. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Decker, G., Weske, M.: Local enforceability in interaction Petri nets. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 305–319. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Zaha, J.M., Barros, A.P., Dumas, M., ter Hofstede, A.H.M.: Let’s dance: A language for service behavior modeling. In: Meersman, R., Tari, Z. (eds.) OTM 2006. LNCS, vol. 4275, pp. 145–162. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Bultan, T., Fu, X.: Specification of realizable service conversations using collaboration diagrams. SOCA 2(1), 27–39 (2008)CrossRefGoogle Scholar
  9. 9.
    Decker, G., Barros, A.P.: Interaction modeling using BPMN. In: ter Hofstede, A.H.M., Benatallah, B., Paik, H.-Y. (eds.) BPM Workshops 2007. LNCS, vol. 4928, pp. 208–219. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  10. 10.
    Zaha, J.M., Dumas, M., ter Hofstede, A.H.M., Barros, A.P., Decker, G.: Service interaction modeling: Bridging global and local views. In: EDOC 2006, pp. 45–55. IEEE Computer Society, Los Alamitos (2006)Google Scholar
  11. 11.
    Lohmann, N., Massuthe, P., Stahl, C., Weinberg, D.: Analyzing interacting BPEL processes. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds.) BPM 2006. LNCS, vol. 4102, pp. 17–32. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Leymann, F.: The (service) bus: Services penetrate everyday life. In: Benatallah, B., Casati, F., Traverso, P. (eds.) ICSOC 2005. LNCS, vol. 3826, pp. 12–20. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Kopp, O., Lessen, T.v., Nitzsche, J.: The need for a choreography-aware service bus. In: YR-SOC, 28–34, Imperial College, London (2008)Google Scholar
  14. 14.
    Decker, G.: Realizability of interaction models. In: ZEUS 2009. CEUR Workshop Proceedings, vol. 438,, pp. 55–60 (2009)Google Scholar
  15. 15.
    Decker, G., Barros, A., Kraft, F.M., Lohmann, N.: Non-desynchronizable service choreographies. In: Bouguettaya, A., Krueger, I., Margaria, T. (eds.) ICSOC 2008. LNCS, vol. 5364, pp. 331–346. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  16. 16.
    Fu, X., Bultan, T., Su, J.: Synchronizability of conversations among Web services. IEEE Trans. Software Eng. 31(12), 1042–1055 (2005)CrossRefGoogle Scholar
  17. 17.
    Massuthe, P., Serebrenik, A., Sidorova, N., Wolf, K.: Can I find a partner? Undecidablity of partner existence for open nets. Inf. Process. Lett. 108(6), 374–378 (2008)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Decker, G., Kopp, O., Leymann, F., Weske, M.: BPEL4Chor: Extending BPEL for modeling choreographies. In: ICWS 2007, pp. 296–303. IEEE Computer Society, Los Alamitos (2007)Google Scholar
  19. 19.
    Lohmann, N., Kopp, O., Leymann, F., Reisig, W.: Analyzing BPEL4Chor: Verification and participant synthesis. In: Dumas, M., Heckel, R. (eds.) WS-FM 2007. LNCS, vol. 4937, pp. 46–60. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  20. 20.
    Lohmann, N., Wolf, K.: Realizability is controllability. In: ZEUS 2009. CEUR Workshop Proceedings, vol. 438,, pp. 61–67 (2009)Google Scholar
  21. 21.
    Salaün, G., Bultan, T.: Realizability of choreographies using process algebra encodings. In: Leuschel, M., Wehrheim, H. (eds.) IFM 2009. LNCS, vol. 5423, pp. 167–182. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  22. 22.
    Kazhamiakin, R., Pistore, M.: Analysis of realizability conditions for Web service choreographies. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229, pp. 61–76. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  23. 23.
    Kaschner, K., Lohmann, N.: Automatic test case generation for interacting services. In: ICSOC 2008. LNCS, vol. 5472, pp. 66–78. Springer, Heidelberg (2008)Google Scholar
  24. 24.
    Gierds, C., Mooij, A.J., Wolf, K.: Specifying and generating behavioral service adapter based on transformation rules. Preprint CS-02-08, Universität Rostock, Rostock, Germany (2008) (submitted to a journal)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Niels Lohmann
    • 1
  • Karsten Wolf
    • 1
  1. 1.Institut für InformatikUniversität RostockRostockGermany

Personalised recommendations