AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee

Abstract

How to compose existing web services automatically and to guarantee the correctness of the design (e.g. freeness of deadlock and unspecified reception, and temporal constraints) is an important and challenging problem in web services. Most existing approaches require a detailed specification of the desired behaviors of a composite service beforehand and then perform certain formal verification to guarantee the correctness of the design, which makes the composition process both complex and time-consuming. In this paper, we propose a novel approach, referred to as AutoSyn to compose web services, where the correctness is guaranteed in the synthesis process. For a given set of services, a composite service is automatically constructed based on L* algorithm, which guarantees that the composite service is the most general way of coordinating services so that the correctness is ensured. We show the soundness and completeness of our solution and give a set of optimization techniques for reducing the time consumption. We have implemented a prototype system of AutoSyn and evaluated the effectiveness and efficiency of AutoSyn through an experimental study.

Labeled Generalized Stochastic Petri Net Based Approach for Web Services Composition

“…An interaction with the developer to provide, in advance, a detailed specification of the composite service, is required by these approaches. The use of DFSA (deterministic finite state automata) is proposed by the authors, in [18], to solve this problem. In this approach, the developers only define the exactness constraints on the composition.…”

Reliability-aware automatic composition approach for web services

“…Intuitively, given a specification ψ and a services library Ω , the synthesis problem is to generate a composite service "on-the-fly" [30,31] that is "automate composition" based on the user request, by realizing ψ with available services. For instance, the synthesization of self-buying and cruise package in Example 1 is an example of the synthesis problem.…”

Complexity of synthesis of composite service with correctness guarantee

“…In [16], we discussed this kind of correctness constraints which belong to safety properties and can be represented by CTL formula. Now we illustrate why and how we can restrict the outputs of users (i.e.…”

“…Huai et al [16] and Pistore et al [17] presented composition framework AutoSyn and Astro, and studied mediator-based synthesis of composite service from CTL formula and EAGLE formula, respectively. In contrast, the composite scenario in this paper is not mediator-based, which means that composite service can be invoked as a component by another composite service.…”

“…In contrast, the composite scenario in this paper is not mediator-based, which means that composite service can be invoked as a component by another composite service. Moreover, in order to handle composition failure, we study the restriction mechanism to environment behaviors which is not considered in [16,17].…”