A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Automated synthesis of composite services with correctness guarantee
2009
Proceedings of the 18th international conference on World wide web - WWW '09
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
doi:10.1145/1526709.1526890
dblp:conf/www/DengHLDG09
fatcat:2zojcsbc4rfoznqwy3vb3hkeyy