【作者】 章洋； 陈俊亮；

【Author】 ZHANG Yang CHEN Jun-liang (State Key Laboratory of Networking and Switching Technology,Beijing University of Posts & Telecommunications,Beijing 100876,China)

【机构】 北京邮电大学网络与交换技术国家重点实验室；

【摘要】 服务计算的重要特征就是利用可编程的服务协同范型和服务交互动作实现服务与资源的聚合。发布订阅的事件机制实现了软件系统在时间、空间和控制上的解耦。然而,如何利用分布式事件实现服务的聚合特征,目前尚缺少有效的理论和方法。本文从服务可协同的角度来论述如何基于分布事件实现服务增量式聚合,即先给出基于事件的服务系统的描述及其行为语义;在此基础上,描述了服务系统的可协同性的定义和判定算法,为服务聚合提供理论基础。更多还原

【Abstract】 The ability to aggregate resources and services is realized through programmable coordination patterns and service interactions in services computing.The pub/sub mechanism achieves the loose-coupling goal of software systems in time,space,and control.However,how to realize aggregation through pub/sub is still a challenge as far as approaches and theories.In this paper,a process algebra was provided to describe services and their behaviors based on distributed events.Then,the definition and detection methods of service coordination were given based on the former.更多还原