摘要
现有的Web服务发现方法主要是基于集中式拓扑,并且使用的服务描述仅仅是描述服务接口功能而忽略了业务流程执行相关信息,无法保证Web服务组合的相容性,也无法满足组合事务无死锁的要求。同时,这些方法都无法避免高维护代价、单点失效和可扩展性差等问题。本文提出一种基于结构化对等网络的Web服务发现方法,引入标识确定性有限状态机ADFSA(Annotated Deterministic Finite State Automata),将服务业务流程执行语言用于服务匹配,从而避免了潜在的Web服务组合不相容和有利于服务组合的自动化。
Current Web service discovery methods are based on centralized approaches where Web services are described with service interface functionality but not business process-related information. It cannot guarantee compatibility of Web service composition, nor can it make Web services easy to complete a deadlock free and bounded process transaction. Furthermore, centralized approaches to service discovery suffer from problems such as high operational and maintenance cost, single point of failure, and bad scalability. Therefore, this paper presents a structured Peer-to-Peer network for Web service discovery in which Web services are located based on service interface functionality and process behavior. It guarantees semantic compatibility of Web service composition, and achieves the automated composition at the level of executable processes.
出处
《计算机科学》
CSCD
北大核心
2007年第7期90-95,共6页
Computer Science
基金
国家自然科学基金资助项目(No90104020)
湖南省自然科学基金(No04JJ3021)
湖南高教基金(No04C290)
关键词
服务组合的相容性
标识确定性有限状态机ADFSA
服务匹配
Compatibility of Web service composition, Annotated deterministic finite state automata, Service match
