Synthesizing cost-minimal partners for services

Abstract

Adapter synthesis bridges incompatibilites between loosely coupled, stateful services. Formally, adapter synthesis reduces to partner synthesis. Beside an adapter, a partner could be a configurator or serve as an ingredient in solutions for discovery and substitution. We synthesize a cost-minimal partner for a given service based on additional behaviorial constraints. We consider the worst case total costs, specifying individual transition costs as natural numbers. In this paper, we sketch our formal approach, and briefly discuss our implementation. © 2013 Springer-Verlag.