Automata based formal approach for verification of Web Service

The composition of Web services and very few studies exist on the verification of composed Web services using puppets to verify the problems of reachability, sparseness departed transition and departed splotching, state space explosion and the deadlock moderately for DFA. In this book, to address this problem, novel theoretical findings on the verification of WSC are presented. By solving the composition problem on non-deterministic Web services, the problems of reachability, sparseness departed transition departed splotching, state explosion and detection of deadlock in FSM model to a greater extent are reduced. These findings suggest that more efficient approximation efforts to devise solutions to the verification of WSC problem are needed.