Authors:
Salima Benbernou
1
;
Djamal Benslimane
1
;
Mohand Said Hacid
1
;
Hamamache Kheddouci
2
and
Kamel Tari
3
Affiliations:
1
Claude Bernard Lyon 1 University, France
;
2
LIESP, Claude Bernard Lyon 1 University, France
;
3
Bejaia University, Algeria
Keyword(s):
Oriented graph, semantic web services, web services composition, web services discovery.
Related
Ontology
Subjects/Areas/Topics:
Internet Technology
;
Web Information Systems and Technologies
;
Web Services and Web Engineering
Abstract:
The automatic web services composition plays an important role in the area of semantic web services. In fact, in a real life it is not usual to discover atomic web services matching with the user’s query. So composing services fulfilling the query is needed. This paper discusses the web services composition model based on an oriented graph. It is based on Bcov algorithm (Benatallah.B et al., 2005a), initially defined for web services discovery and considered as the best cover problem, which it was mapped as the problem of computing the minimal transversals with minimum cost of a weighted hypergraph. We propose two algorithms handling the oriented graph reasoning for web service composition. At first glance, a basic composition version for Bcov algorithm is given. The algorithm composes services over the induced subgraphs of each transversal provided by Becov algorithm, and gives a covering ratio satisfying the query. The second algorithm used a composed services graph maintained by a
web services provider. The composition in that case is based on Dijkstra algorithm, where for each two consecutive services in the best minimal transversal provided by Bcov algorithm, a shortest path is computed regarding the composed services graph.
(More)