Skip to Main content Skip to Navigation

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00459358
Contributor : Emmanuelle Grousset <>
Submitted on : Tuesday, February 23, 2010 - 5:09:24 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Document(s) archivé(s) le : Friday, June 18, 2010 - 9:47:22 PM

File

ase09v7-.pdf
Files produced by the author(s)

Identifiers

  • 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, IEEE/ACM, Nov 2009, Auckland, New Zealand. ⟨inria-00459358⟩

Share

Metrics

Record views

304

Files downloads

308