Automatic web service composition with abstraction and refinement

ABSTRACT

The behavioral description based Web Service Composition (WSC) problem aims at the automatic construction of a coordinator web service that controls a set of web services to reach a goal state. However, solving the WSC problem exactly with a realistic model is doubly-exponential in the number of variables in web service descriptions. In this paper, we propose a novel efficient approximation-based algorithm using automatic abstraction and refinement to dramatically reduce the number of variables needed to solve the problem.

REFERENCES

• 1: Fabio Barbon , Paolo Traverso , Marco Pistore , Michele Trainotti, Run-Time Monitoring of Instances and Classes of Web Service Compositions, Proceedings of the IEEE International Conference on Web Services, p.63-71, September 18-22, 2006 [doi>10.1109/ICWS.2006.113]
• 2: Hyunyoung Kil , Wonhong Nam , Dongwon Lee, Computational Complexity of Web Service Composition Based on Behavioral Descriptions, Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence, p.359-363, November 03-05, 2008 [doi>10.1109/ICTAI.2008.47]
• 3: M. Pistore, A. Marconi, P. Bertoli, and P. Traverso. Automated composition of web services by planning at the knowledge level. In Proc. of IJCAI, pages 1252--1259, 2005.
• 4: P. Traverso and M. Pistore. Automated composition of semantic web services into executable processes. In Proc. of ISWC, pages 380--394, 2004.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.5 On-line Information Services
          Subjects: Web-based services

General Terms:
Algorithms, Experimentation

Keywords:
abstraction, refinement, service composition