A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Synthesizing Cost-Minimal Partners for Services
[chapter]
2013
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-45005-1_49
fatcat:u32fsroczzenfmuvv63i5hwqx4