Dynamically selecting suitable Web Services (WSs) is crucial to users in Web Services Composition (WSC). Generally, most works regard a Web Service (WS) as the basic unit and compose the composite WS (CWS) end to end. However, a WS may comprise multiple operations that are invoked in sequence and the selection of WSs according to the model still is a NP problem. In this study, the WSs consist of some operations and then WSs selection problem is formalized as a Finite State Machine (FSM) process. This study proposed an algorithm to create the WSC Tree (WSCT), in which each path from root to leaf node is a feasible WSC execution path. Then, a heuristic algorithm is proposed to realize the selection of WSs based on the WSCT. The advantage of heuristic algorithm is that it can address the selection problem without traversing the whole WSCT but it still spends much time in the construction of the WSCT. So, in order to further decrease the time of selection, a backtracking algorithm is presented to select a feasible execution path without generating WSCT. At last, experiments show that heuristic algorithm is more effective than exhaustive method and the backtracking algorithm spend the less time than heuristic algorithm, the reliability of WSC execution path selected by backtracking algorithm can satisfy the requirement of users. So, this study proposed an algorithm to select a feasible WSC execution path within a reasonable time
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.