Checking Robustness of Web Services Based on the Parallel Composition of Partial Timed Finite State Machines

摘要

In this paper, we discuss how the robustness of the web service can be checked using the parallel composition of partial timed finite state machines. We propose a technique for checking this property. In fact, we check whether there are no deadlocks in the composition. If deadlocks can happen, then we propose ways to solve this problem. We also discuss selecting the server implementation that can robustly work with the given client application.