Time: 1.5 hours
Nikola Milanovic, Miroslaw Malek, "Current Solutions for Web Service Composition," IEEE Internet Computing, vol. 8, no. 6, pp. 51-59, Nov./Dec. 2004, doi:10.1109/MIC.2004.58
Nikola Milanovic (2006年博士毕业, 目前在柏林工业大学)
Research Interest: Service oriented architectures and service composition, etc.
本文是早期一篇关于Web Service Composition的综述, GS显示被引用了288次. 对这种经典论文, 应该抽空系统地看一下, 自己写论文时很可能要引用的.
以下是论文摘录:
1. 作者首先提出了4个Service Composition Requirements
(1) connectivity
可连通性, 是指一个服务的输入可以作为另一个服务的输出? (文章里讲的不太严谨)
(2) nonfunctional quality-of-service properties
(3) correctness
verification of the composed service' properties, such as security and dependability
(4) scalability
2. 然后作者依次介绍当时流行的几种组合方法, 包括
BPEL, OWL-S, Web Components, Algebraic Process Composition, Petri Nets, Model Checking and Finite State Machines
摘录几种不太熟悉的组合方式
(1) Web Components
"The main idea is to encapsulate composite-logic information inside a class definition, which represents a Web component. A Web component's public interface can then be published and used for discovery and reuse."
以前没听说过这种组合方式, EI里面搜了一下"Web Component"和service有关的论文, 只有寥寥数条记录, 且多是早些年时候的. 看来这种组合方式已经不流行了, 暂时就不关注细节了. 如果有兴趣, 可以参考:
J. Yang and M.P. Papazoglou, "Web Component: A Substrate for Web Service Reuse and Composition," Proc. 14th Conf. Advanced Information Systems Eng. (CAiSE 02),LNCS 2348, Springer-Verlag, 2002, pp. 21–36.
(2) Algebraic Process Composition
π演算就属于这一类, 与Petri Net类似, 都是形式化方法, 主要特点是可以验证服务组合的正确性, 比如liveness.
(3) Model Checking and Finite State Machines
作者的介绍比较简单(不到半页), 没有相关背景知识看不懂.
3. 这几种组合方法的比较 
Comment: 看完这篇, 没有得到太多. 可能是因为这篇比较老, 且是杂志上的文章, 只是简单的介绍.