Service Substitution Revisited

Abstract : The current state of the art concerning the problem of service substitution raises the following issue: the complexity of the substitution process scales up with the number of available services that may serve as candidate substitutes for a target service. To deal with this issue, we propose a framework that is based on two substitution relations and corresponding theorems. The proposed relations and theorems allow organizing available services into groups. Then, the complexity of retrieving candidate substitute services for the target service and generating corresponding adapters scales up with the number of available groups, instead of scaling up with the number of available services.
Type de document :
Communication dans un congrès
24th IEEE/ACM International Conference on Automated Software Engineering - ASE 2009, Nov 2009, Auckland, New Zealand. 2009
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00459358
Contributeur : Emmanuelle Grousset <>
Soumis le : mardi 23 février 2010 - 17:09:24
Dernière modification le : vendredi 25 mai 2018 - 12:02:02
Document(s) archivé(s) le : vendredi 18 juin 2010 - 21:47:22

Fichier

ase09v7-.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00459358, version 1

Collections

Citation

Dionysis Athanasopoulos, Apostolos Zarras, Valérie Issarny. Service Substitution Revisited. 24th IEEE/ACM International Conference on Automated Software Engineering - ASE 2009, Nov 2009, Auckland, New Zealand. 2009. 〈inria-00459358〉

Partager

Métriques

Consultations de la notice

267

Téléchargements de fichiers

187