Correctness Of Service Composition Research Articles

Study on the Correctness of Web Service Composition Evolution

When Internet has been becoming a platform of all kinds of resources sharing and integrating, service computing can just satisfy this kind of computation. When the users needs and the running environment change frequently, the original structure of the composite service should be rebuilt and reconfigured to need these alterations. Since the availability and the reliability of service composition will not be guaranteed, the correctness of service composition evolution must be verified. In this paper, a formal model-WSPN was presented to describe service composition evolution, WSPN can express the structure of service composition and also can simulate the evolving process of the composite service. In order to keep the evolving correctness of Web service composition, an algorithm was provided to verify the composition relationship between both component services, in this way, the reasonable relationship can be obtained. Finally, the concluding remarks and the future work were pointed out.

Verifying Web Services Composition Based on Interface Automata Using SPIN

Web services are a very appropriate communication mechanism to perform distributed business processes among several organizations. These processes should be reliable, because a failure in them can cause high economic losses. To provide a framework to compose lots of specialized services flexibly, BPEL4WS is proposed to describe Web services composition. But the language is lack of the support for checking the correctness of composition. It has to depend on formal verification method which helps to check the correctness of services composition. In order to solve above shortages of BPEL4WS, This paper presents a formal approach which verifies BPEL4WS using the interface automata. In this approach, BPEL4WS is mapped into interface automata, which is then transformed into Promela (It is the input language of SPIN model checker.), and the correctness properties of Web services composition can be verified by SPIN. Finally, paper gives a case study to illustrate the proposed approach.

Model transformation and formal verification for Semantic Web Services composition

Web services composition is becoming more and more important in today's service oriented business environment. We need to compose services from different providers together to fulfill the business goals that cannot be satisfied by any single service. However, different services often have semantic inconsistencies which may lead to the failure of the services composition. In order to verify the correctness of the Semantic Web Services composition, this paper proposed a composition model of Coloured Petri Nets which is transformed from OWL-S model. This model can express the logical relations among the sub-processes of the services composition explicitly, and verify the correctness of the services composition using formalized methods of Coloured Petri Nets. This paper presented the verification algorithms for the reachability, boundness and semantic consistency of composed services. Furthermore, an example of collaborating design process was given to simulate and execute the model.