Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Emmanuelle Grousset Connect in order to contact the contributor
Submitted on : Tuesday, February 23, 2010 - 5:09:24 PM
Last modification on : Friday, February 4, 2022 - 3:10:35 AM
Long-term archiving on: : Friday, June 18, 2010 - 9:47:22 PM


Files produced by the author(s)


  • HAL Id : inria-00459358, version 1



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⟩



Record views


Files downloads