Dependency Based Automatic Service Composition Using Directed Graph

In this paper a method of automatic composition plan creation that relies on automatic extraction of dependencies among services is investigated. For automatic dependency extraction our approach makes use of semantic similarities between I/O parameters of services. Extracted I/O dependencies are represented using a directed graph. The approach recognizes when cyclic dependencies exist and proposes a way of dealing with it. Modified topological sorting algorithm is used for the execution plan generation showing execution order of candidate services. A case study is used to explain the proposed approach.