Graph Based Approach for Dynamic Discovery of Composite Web Services

As more web services can be used over the Internet, the need to find and combine dynamically efficient services to fulfill a given goal becomes an important and challenging task. To this end, we are interested particularly in dynamic approaches for web service composition. In contrast to the static ones, a composition of services is called dynamic if participant services are selected and composed on the fly based on the needs formulated by the user and the availability of published services. We propose in this work, a flow-graph based system for service composition and composite service discovery to satisfy a functional need of a given query. The idea is to model all the possible connections between published services as Output-Input semantic matching. These established connections are stored in a graph called precedence graph in order to retrieve dynamically, all possible plans that could answer a given query.