Service substitution revisited

Dionysis Athanasopoulos*, Apostolos V. Zarras, Valerie Issarny

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

In this paper we propose a framework that reduces the complexity of service substitution. The framework 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.

Original languageEnglish
Title of host publicationASE2009 - 24th IEEE/ACM International Conference on Automated Software Engineering
Pages555-559
Number of pages5
DOIs
Publication statusPublished - 01 Dec 2009
Externally publishedYes
Event24th IEEE/ACM International Conference on Automated Software Engineering, ASE2009 - Auckland, New Zealand
Duration: 16 Nov 200920 Nov 2009

Conference

Conference24th IEEE/ACM International Conference on Automated Software Engineering, ASE2009
Country/TerritoryNew Zealand
CityAuckland
Period16/11/200920/11/2009

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Fingerprint

Dive into the research topics of 'Service substitution revisited'. Together they form a unique fingerprint.

Cite this