The behavioral description-based Web Service Composition (WSC) problem deals with the automatic construction of a coordinator web service that controls a set of web services to reach the goal states. Despite its importance and implications, however, very few studies exist on the computational complexities of the WSC problem. In this paper, to address this problem, we present four novel theoretical findings on the WSC problem: (1) Solving the composition problem of deterministic web services for a restricted case (when the coordinator web service has complete information about the states of all web services) is PSPACE-hard, (2) Solving the composition problem of deterministic web services for a general case (when the coordinator web service has incomplete information about the states of web services) is EXPSPACE-hard, (3) Solving the composition problem of nondeterministic web services on complete information is EXP-hard, and (4) Solving the composition problem of non-deterministic web services on incomplete information (which is the most general case) is 2-EXP-hard. These findings suggest that more efforts to devise efficient approximation solutions to the WSC problem be needed.
Nam et al. REF studied the computational complexities of the behavioral description-based Web service composition, and concluded that the composition problem of nondeterministic web services with incomplete information, to be 2-EXP-complete.
On the Computational Complexity of Behavioral Description-Based Web Service Composition
Theor. Comput. Sci.
Theor. Comput. Sci.
Computer Science