3
Introduction Open World Assumption –System depends on the functional and qualitative evolution of partner services Self-adaptation is a way to cope with these evolutions –Substitute a service with a compatible alternative Conversational services impose: –a specific interaction protocol and –specific data types 3

9
Isolating P’s interactions Delete basic interactions that do not involve P Remove sequential structures that do not contain basic interactions Omit And branches that contain no interactions Reduce And structures with a single branch to a path Collapse Or branches into one (highest preference level) 9 Flatten out Or structures, and generate all the possible combinations of Or branches

10
Graph construction 10

11
Graph construction The nodes are enumerated following the temporal sequence and a specific ordering of And branches The degree of importance is spread onto the structural arcs Redundant nodes are removed The candidate’s graph is built using the same procedure but reversing the direction of interaction edges 11

12
Analysis procedure a.Structural comparison –Graphs with the same size have to be identical –If the sizes do not match, nodes that are not strictly necessary can be deleted b.Data type comparison –Structural similarity: cost of transforming one message into the other by means of Tree Edit Operations –Content similarity: Wordnet 12

15
The Future of ISC Continue to validate the algorithm Close the loop –Process adaptation and Data type adapters Extend beyond BPEL Refine ISCs with properties inferred from history of interactions –Refined meaning of compatibility with actual partner –What am I looking for in a new partner? 15