Backing composite web services using formal concept analysis

  • Authors:
  • Zeina Azmeh;Fady Hamoui;Marianne Huchard;Nizar Messai;Chouki Tibermacine;Christelle Urtado;Sylvain Vauttier

  • Affiliations:
  • LIRMM - CNRS & Univ. Montpellier II, France;LIRMM - CNRS & Univ. Montpellier II, France and LGI2P - Ecole des Mines d'Alès - Nîmes, France;LIRMM - CNRS & Univ. Montpellier II, France;MAS - Ecole Centrale Paris, France;LIRMM - CNRS & Univ. Montpellier II, France;LGI2P - Ecole des Mines d'Alès - Nîmes, France;LGI2P - Ecole des Mines d'Alès - Nîmes, France

  • Venue:
  • ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A Web service is a software functionality accessible through the network. Web services are intended to be composed into coarser-grained applications. Achieving a required composite functionality requires the discovery of a collection of Web services out of the enormous service space. Each service must be examined to verify its provided functionality, making the selection task neither efficient nor practical. Moreover, when a service in a composition becomes unavailable, the whole composition may become functionally broken. Therefore, an equivalent service must be retrieved to replace the broken one, thus spending more time and effort. In this paper, we propose an approach for Web service classification based on FCA, using their operations estimated similarities. The generated lattices make the identification of candidate substitutes to a given service straightforward. Thus, service compositions can be achieved more easily and with backup services, so as to easily recover the functionality of a broken service.