By Topic

Ranking BPEL Processes for Service Discovery

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Grigori, D. ; Lab. PRiSM, Univ. of Versailles-St-Quentin-En-Yvelines, Versailles, France ; Corrales, J.C. ; Bouzeghoub, M. ; Gater, A.

Finding useful services is a challenging and important task in several applications. Current approaches for services retrieval are mostly limited to the matching of their inputs/outputs. In this paper, we argue that in several applications (services having multiple and dependent operations and scientific workflows), the service discovery should be based on the specification of service behavior. The idea behind is to develop matching techniques that operate on behavior models and allow delivery of approximate matches and evaluation of semantic distance between these matches and the user requirements. To do so, we reduce the problem of behavioral matching to a graph matching problem and adapt existing algorithms for this purpose. To validate our approach, we developed a BPEL ranking platform that allows to find in a service repository, a set of service candidates satisfying user requirements, and then, to rank these candidates using a behavioral-based similarity measure.

Published in:

Services Computing, IEEE Transactions on  (Volume:3 ,  Issue: 3 )