By Topic

The Service Adaptation Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wang, K. ; Fac. of IT, Queensland Univ. of Technol., QLD ; Dumas, M. ; Chun Ouyang ; Vayssiere, J.

The reuse of software services often requires the introduction of adapters. In the case of coarse-grained services, and especially services that engage in long-running conversations, these adapters must deal not only with mismatches at the level of individual interactions, but also across interdependent interactions. Existing techniques support the synthesis of adapters at design-time by comparing pairs of service interfaces. However, these techniques only work under certain restrictions. This paper explores a runtime approach to service interface adaptation. The paper proposes an adaptation machine that sits between pairs of services and manipulates the exchanged messages according to a repository of mapping rules. The paper formulates an operational semantics for the adaptation machine, including algorithms to compute rule firing sequences and criteria for detecting deadlocks and information loss. The adaptation machine has been implemented as a prototype and tested on common business processes.

Published in:

on Web Services, 2008. ECOWS '08. IEEE Sixth European Conference

Date of Conference:

12-14 Nov. 2008