Checking Robustness of Web Services based on Solving Automata Equations

In this paper, we consider checking the robustness of web services using the model of finite state automata and analyzing the solvability of an automaton equation over the concatenation operator. The paper contains the procedure for constructing the largest solution for a solvable automata equation, since a solution to the equation describes a malicious input. Experimental results have shown that this approach can be effective when checking the robustness of web services.