A Lower Bound on Web Services Composition

  • Anca Muscholl
  • Igor Walukiewicz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4423)


A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where the construction is understood as a simulation of the specification by a fully asynchronous product of the given services. We show an EXPTIME-lower bound for this problem, thus matching the known upper bound. Our result also applies to richer models of web services, such as the Roman model.

Keywords: Automata simulation, complexity, web services composition.


  1. 1.
    Alonso, G., et al.: Web Services. Concepts, Architectures and Applications. Springer, Heidelberg (2004)MATHGoogle Scholar
  2. 2.
    Berardi, D., et al.: Automatic composition of e-services that export their behavior. In: Orlowska, M.E., et al. (eds.) ICSOC 2003. LNCS, vol. 2910, pp. 43–58. Springer, Heidelberg (2003)Google Scholar
  3. 3.
    Berardi, D., et al.: Automatic composition of web services in colombo. In: SEBD 2005, pp. 8–15 (2005)Google Scholar
  4. 4.
    Berardi, D., et al.: Automatic composition of web services with messaging. In: VLDB 2005, pp. 613–624 (2005)Google Scholar
  5. 5.
    Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114–133 (1981)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Deutsch, A., Sui, L., Vianu, V.: Specification and verification of data-driven web services. In: Symposium on Principles of Database Systems (PODS) (2004)Google Scholar
  8. 8.
    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)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Hull, R., et al.: E-services: a look behind the curtain. In: Symposium on Principles of Database Systems (PODS), pp. 1–14 (2003)Google Scholar
  10. 10.
    Laroussinie, F., Schnoebelen, P.: The state explosion problem from trace to bisimulation equivalence. In: Tiuryn, J. (ed.) ETAPS 2000 and FOSSACS 2000. LNCS, vol. 1784, pp. 192–207. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  11. 11.
    Pistore, M., et al.: Automated composition of web services by planning at the knowledge level. In: International Joint Conference on Artificial Intelligence (IJCAI) (2005)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Anca Muscholl
    • 1
  • Igor Walukiewicz
    • 1
  1. 1.LaBRI, Université Bordeaux 1 and CNRS, 351, Cours de la Libération, F-33 405, Talence cedexFrance

Personalised recommendations