scholarly journals Retracted: Towards Formal Verification of Web Service Composition

2006 ◽  
pp. 257-273 ◽  
Author(s):  
Mohsen Rouached ◽  
Olivier Perrin ◽  
Claude Godart
Keyword(s):  
Formal Verification ◽  
Web Service ◽  
Service Composition ◽  
Web Service Composition

A Formal Verification for Web Service Composition Based on CCS

2008 ◽  
Vol 392-394 ◽  
pp. 330-334 ◽  
Author(s):  
B.S. Yun ◽  
J.W. Yan ◽  
M. Liu
Keyword(s):  
Formal Verification ◽  
Web Service ◽  
Service Composition ◽  
Composition Operators ◽  
Web Service Composition ◽  
Composition Algebra ◽  
Dynamic Behaviors ◽  
Formal Tool ◽  
Transformation Mechanisms

Web service composition is a complex and error-prone process. To guarantee its correctness, CCS is exploited as a formal tool to model Web service composition. Composition algebra is defined to specify the rules through which a compositive service can be generated. The transformation mechanisms from service compositions into CCS formalisms according to their corresponding composition operators are gone into details. Then, the automatic reasoner CWB is used to validate the constructed model, by which the dynamic behaviors of the model can be verified and such composition errors as deadlocks can be detected in advance, thus enhancing the composition reliability and avoiding runtime failure. Finally, an example is given to illustrate the effectiveness of this approach.

Formal Verification of WS-BPEL Using Timed Trace Theory

2014 ◽  
Vol 931-932 ◽  
pp. 1452-1456 ◽  
Author(s):  
Wutthipong Kongburan ◽  
Denduang Pradubsuwun
Keyword(s):  
Formal Verification ◽  
Web Service ◽  
Service Composition ◽  
Business Processes ◽  
Web Service Composition ◽  
Business Process Execution Language ◽  
Trace Theory ◽  
Business Process Execution ◽  
Reservation System ◽  
The Web

A web service composition is able to create a new service by incorporating some existing web services. Currently, Web Service Business Process Execution Language or WS-BPEL is a promising language used to describe the web service composition. Since in the real world most of business processes have been involved temporal context and they are quite complex interaction, it is impossible to completely eliminate all failures in them. Therefore, a formal verification is required to assure the correctness and reliability of the web service composition. In this paper, timed trace theory has been applied to verify the web service composition with temporal constraints. Both safety and timing failures can be examined. Experimenting with a ticket reservation system, the proposed approach shows its effectiveness.

Sign in / Sign up

Export Citation Format

Share Document