Abstract
During the last decade, software engineering community has witnessed the emerging of SOA architecture, where Web services play a crucial role. It prompts the concept of Web Service Composition (WSC). Even though interesting, this issue posed some remarkable challenges, one of which is constraint handling. To be more precise, one needs to ensure that the composite Web service fulfills, at the same time, many constraints, including functional constraints, Quality of Service (QoS), and the execution order of the component services, or temporal relations. Those constraints are of different natures, thus finding an efficient verification on all kinds of constraints during the composition process is by no means a trivial task. Backed by a solid foundation of temporal logic, model checking (MC) is a suitable approach to handle this issue. However, MC-based approach suffers from the infamous problem of state-space explosion, making it limited when applied to real-life situations. The work in this paper addresses the problem by proposing various approaches for handling the state-space exploration, including (i) an introduction of an LTS-based model known as LTS4WS, which can avoid generating full schema of Web service composition and allow on-the-fly verification on the state space; (ii) heuristics strategies to find the best potential composition, and (iii) a bitwise-based indexing mechanism for fast location of suitable Web services. All of those approaches are unified in a single tool, known as WSCOVER. As a result, a significant improvement of performance has been made, especially as compared with the other existing works in the same field.
Highlights
1.1 Web service composition and verificationNowadays, Web Service Composition (WSC) has been raised as an important issue of Service-Oriented Architecture (SOA) [1]
We propose an approach to represent the Web services by the Labelled Transition System (LTS), known as LTS4WS, to serve for the application of model checking for Web service composition
The experiments are performed on multiple real data sets and the results show the effectiveness of this approach compared with [10] and other approaches
Summary
Research community has a lot of work related to WSC problem, which can be classified into three groups as follows. 6.1.1 Composition based on hard constraints. WS-Engineer [22] is typical work for the Web service verification based on the functional properties. A recent study carried out to verify combined functional and nonfunctional requirements of WSC is introduced as VeriWS [5], which takes in a full composition schema expressed in BPEL and uses the model checker to verify. WSC only involves the functional properties (hard constraints) which is the classic problem of SOA, which are mostly based on the theory of planning of the artificial intelligence field (AI Planning), such as [4] and [19]. Some recent studies are based on abstract models, such as Petri net or Colored Petri Net [12,13,14] to compose and verify Web services. The studies [12,13,14] give the automatic WSC techniques based on Petri net (or Colored Petri net)
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
