Using models of finite transition systems for checking web-service security

In this paper we discuss how the web-service security can be checked using finite automata. We analyze existed attack patterns and discuss different representations for these patterns. We also consider automata equations in order to describe malicious inputs. We describe a class of such equations that have no solutions and provide some venues for a future work.