关键词: 组合不相容 确定性有限状态机 服务匹配

Abstract:

The current Web services discovery methods are based on centralized approaches among which Web services are described with service interface functions  but not process-related information. It cannot guarantee the compatibility of Web services composition, nor can it make Web services easy to complete a  deadlock-free and bounded process transaction. Furthermore, centraiized approaches to service discovery suffer from the problems such as high operation al and maintenance cost, single point failure, and scalability. Therefore, we propose a structured peer-to-peer framework for Web services discovery in  which Web services are located based on service functionality and process behaviors. It guarantees the semantic compatibility of Web services compositio n, and achieves the automated composition at the level of executable process.

Key words: （incompatibility of web services composition;deterministic finite state automata;service match）