Predicting and Learning Executability of Composite Web Services

  • Masahiro Tanaka
  • Toru Ishida
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5364)


Configuring a composite Web service by setting endpoints reduces the cost of development, but raises the probability of a request message triggering runtime execution failures. Previous works on validation of composite Web services are not useful because the application developer cannot modify atomic/composite services and the specifications needed for validation are not always available. Therefore, in this paper, we address two issues: predicting the executability of composite Web services for each request message, and acquiring input specifications to improve the prediction. To resolve these issues, we model atomic/composite services in a formal specification. Moreover, we apply constraint acquisition algorithm to acquire input specifications of atomic Web services. We conduct an experiment in which the proposed method is applied to a composite Web service in practical use. The result shows that our method can detect almost all messages that will trigger execution failure at a rather early stage of specification acquisition.


Target Language Request Message Composite Service Logical Formula Application Developer 
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.


  1. 1.
    Narayanan, S., McIlraith, S.A.: Simulation, verification and automated composition of web services. In: The 11th International Conference on World Wide Web (WWW 2002), pp. 77–88 (2002)Google Scholar
  2. 2.
    Ankolekar, A., Paolucci, M., Sycara, K.: Towards a formal verification of owl-s process models. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 37–51. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Fu, X., Bultan, T., Su, J.: Analysis of interacting bpel web services. In: The 13th conference on World Wide Web (WWW 2004), pp. 621–630 (2004)Google Scholar
  4. 4.
    Bessière, C., Coletta, R., O’Sullivan, B., Paulin, M.: Query-driven constraint acquisition. In: The 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 50–55 (2007)Google Scholar
  5. 5.
    Futatsugi, K., Nakagawa, A.: An overview of cafe specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks. In: The 1st International Conference on Formal Engineering Methods, pp. 170–181 (1997)Google Scholar
  6. 6.
    Ishida, T.: Language grid: An infrastructure for intercultural collaboration. In: IEEE/IPSJ Symposium on Applications and the Internet (SAINT 2006), pp. 96–100 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Masahiro Tanaka
    • 1
  • Toru Ishida
    • 1
  1. 1.Department of Social InformaticsKyoto UniversityKyotoJapan

Personalised recommendations