Title :
Generating Quantitative Test Cases for Probabilistic Timed Web Service Composition
Author :
Gao, Honghao ; Li, Ying
Author_Institution :
Sch. of Comput. Eng. & Sci., Shanghai Univ., Shanghai, China
Abstract :
The environment of enterprise applications is characterized by frequently changing market demands, time-to-market pressure and fierce competition. To seamlessly integrate complex computing activities, Web Service Composition (WSC) has been regarded as an emerging E-Commerce solution to support interoperable machine-to-machine business interactions over network. To guarantee the composite Web service can be successfully produced, testing is a preferred validation technique to efficiently verify the correctness of functional and nonfunctional requirements of WSC behaviors. BPEL4WS is a high level and semi-formal abstract description language for WSC orchestration. Manually generating test cases from BPEL4WS is tedious, time-consuming, and error prone. Thus, the automated test case generation plays a critical role in all the phases of Web service life cycle. Considering the uncertain environment, an extended WSC model, namely probabilistic timed interface automata for Web service (PTIA4WS), is pro-posed to transform and extend BPEL4WS with regard to the stochastic and time-related behaviors. Based on PTIA4WS model, we propose an approach for generating quantitative test cases from counterexamples of violated PTCTL formulae using coverage criterions. After that, timed test case with fastest execution response time and probabilistic test case with maximal execution success rate are discussed. The series of experiments show that our method gains better performance than traditional methods.
Keywords :
Web services; electronic commerce; probabilistic automata; PTIA4WS model; WSC orchestration; Web service; complex computing activities; coverage criterions; e-commerce solution; enterprise applications; execution response time; functional requirements; interoperable machine-to-machine business interactions; market demands; maximal execution success rate; nonfunctional requirements; probabilistic test case; probabilistic timed interface automata; quantitative test cases; semiformal abstract description language; stochastic behaviors; time-related behaviors; time-to-market pressure; Automata; Clocks; Probabilistic logic; Stochastic processes; Testing; Time factors; Web services; Optimization; Probabilistic Behaviriors; Test Cases; Time Constrains; Web Service Composition;
Conference_Titel :
Services Computing Conference (APSCC), 2011 IEEE Asia-Pacific
Conference_Location :
Jeju Island
Print_ISBN :
978-1-4673-0206-7
DOI :
10.1109/APSCC.2011.13