Automated Synthesis of Composite Services with Correctness Guarantee

Published Version

Preview

PDF (747Kb)

Abstract

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. In this paper we propose a novel approach to synthesize the composite service from a given set of services, where the designer only needs to set the correctness constraints on the desired behaviors of the targeted service and the synthesis will be automatically performed with the correctness guaranteed. We implemented a prototype system and the preliminary experimental results on a practical travel agent example show that our synthesis approach is effective and efficient.