TY - GEN
T1 - Automated synthesis of composite services with correctness guarantee
AU - Deng, Ting
AU - Huai, Jinpeng
AU - Li, Xianxian
AU - Du, Zongxia
AU - Guo, Huipeng
PY - 2009
Y1 - 2009
N2 - In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified reception, and temporal constraints in Computation Tree Logic formula. An automated synthesis algorithm based on learning algorithm is introduced, which guarantees that the composite service is the most general way of coordinating services so that the correctness is ensured. We have implemented a prototype system evaluating the effectiveness and efficiency of our synthesis approach through an experimental study. Copyright is held by the author/owner(s).
AB - In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified reception, and temporal constraints in Computation Tree Logic formula. An automated synthesis algorithm based on learning algorithm is introduced, which guarantees that the composite service is the most general way of coordinating services so that the correctness is ensured. We have implemented a prototype system evaluating the effectiveness and efficiency of our synthesis approach through an experimental study. Copyright is held by the author/owner(s).
KW - Composition synthesis
KW - Correctness constraints
KW - Learning algorithm
UR - https://www.scopus.com/pages/publications/84865614095
U2 - 10.1145/1526709.1526890
DO - 10.1145/1526709.1526890
M3 - 会议稿件
AN - SCOPUS:84865614095
SN - 9781605584874
T3 - WWW'09 - Proceedings of the 18th International World Wide Web Conference
SP - 1127
EP - 1128
BT - WWW'09 - Proceedings of the 18th International World Wide Web Conference
T2 - 18th International World Wide Web Conference, WWW 2009
Y2 - 20 April 2009 through 24 April 2009
ER -