Resilient composition of Web services through nondeterministic planning

Abstract

This paper presents an approach for Web service (WS) composition that enables the automatic adjustment of the composition at run-time to deal with WS execution flaws, e.g., WS unavailability, failure to execute properly or to produce desired results. The WS composition problem is converted into a nondeterministic planning problem which, by its turn, is mapped to SAT. Afterwards, a SAT solver obtains all the possible WS compositions with a maximum length N, which are then fused into a contingency strategy (CS) according to compatibility criteria. Such strategy enables the process execution engine to readily choose the most suitable WS composition to enact, and switch to an alternative composition with minimum adaptation cost in case of any WS execution flaw.