Computational complexity of web service composition based on behavioral descriptions

Hyunyoung Kil, Wonhong Nam, Dongwon Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach the goal states. As such, WSC is one of the fundamental techniques to enable the Service Oriented Architecture on the Web. Despite its importance and implications, however, very few studies exist on the computational complexities of the WSC problem. In this paper, we present two novel theoretical findings on WSC problems: (1) Solving the WSC problem with "complete " information is EXP-hard, and (2) Solving the WSC problem with "incomplete" information is 2-EXP-hard. These findings imply that more efforts to devise efficient approximate solutions to the WSC problem be needed.

Original languageEnglish (US)
Title of host publicationProceedings - 20th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'08
Pages359-363
Number of pages5
DOIs
StatePublished - 2008
Event20th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'08 - Dayton, OH, United States
Duration: Nov 3 2008Nov 5 2008

Publication series

NameProceedings - International Conference on Tools with Artificial Intelligence, ICTAI
Volume1
ISSN (Print)1082-3409

Other

Other20th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'08
Country/TerritoryUnited States
CityDayton, OH
Period11/3/0811/5/08

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Computational complexity of web service composition based on behavioral descriptions'. Together they form a unique fingerprint.

Cite this