원문정보
초록
영어
Web service choreography is a methodology for building value-added applications by aggregating several existing web services together according to business requirements. Web service choreography has been widely explored in the past and various approaches have been proposed. Only a few works have been carried out for verification of composed web services for deterministic system and no work has been carried for non-deterministic system. This paper introduces an approach for verifying the WSC using Revise Buchi Automata (RBA) for non-deterministic system. The correctness properties of the non-deterministic system have been evaluated based on sparseness and reachability problem. Primarily the web services are composed by using Web Service Choreography Description Language (WS-CDL) and then the composed service is translated into RBA. A new algorithm called Revise Buchi Sparseness Reachability (RBSR) has been developed to avoid the Sparseness problem and Reachability problem. A tool (WSCVT) has been developed using jave for verifying the RBSR algorithm. The proposed approach is verified using this tool and the results revealed better performance in terms of avoiding sparseness and reachability problems at 95% compared to the existing approaches.
목차
1. Introduction
2. System Overview
2.1. Application Overview
3. System Architecture
3.1. WSCVT
4. RBSR Algorithm
4.1. WSC
4.2. Web Services Composition Verification
5. Case Study (Tourist Places, Transport, Hotel)
7. Comparison of WSCVT with Uppaal
8. Comparisons with Existing Work and Proposed Work
9.1. Performance evaluation-statistical approach
10. Related Works
11. Conclusions and Future Work
References