Verifying Service Composition Based on Modular Reachability Graph and Generating BPEL Codes

2010 ◽  
Vol 21 (8) ◽  
pp. 1810-1819 ◽  
Author(s):  
Yan-Hua DU ◽  
Yu-Shun FAN ◽  
Xi-Tong LI
Keyword(s):  
Service Composition ◽  
Reachability Graph

Protocol-Level Service Composition Mismatches

2012 ◽  
pp. 50-70
Author(s):  
PengCheng Xiong ◽  
Calton Pu ◽  
MengChu Zhou
Keyword(s):  
Web Service ◽  
Petri Net ◽  
Service Composition ◽  
State Of The Art ◽  
Optimal Solution ◽  
The State ◽  
Generation Process ◽  
Reachability Graph ◽  
The Future ◽  
Low Efficiency

Protocol-level mismatch is one of the most important problems in service composition. The state-of-the-art method to deal with protocol mismatch is to generate adaptors to check deadlock-freeness based on a reachability graph. When this property is violated, the generation process will repeat itself until no deadlock state is found; however, the main drawback of this method is that it does not take into account the future deadlock state and requires many interactions with a developer. In this regard, it suffers from low efficiency. In this paper, the authors model multiple web service interaction with a Petri net called Composition net (C-net). The protocol-level mismatch problem is transformed into the empty siphon problem of a C-net. The authors take future deadlock states into consideration through this model, while finding the optimal solution that involves fewest interactions with a developer. The proposed method is proved to achieve higher efficiency for resolving protocol-level mismatch issues than traditional ones.

Protocol-Level Service Composition Mismatches

2010 ◽  
Vol 7 (4) ◽  
pp. 1-20 ◽  
Author(s):  
PengCheng Xiong ◽  
Calton Pu ◽  
Mengchu Zhou
Keyword(s):  
Web Service ◽  
Petri Net ◽  
Service Composition ◽  
State Of The Art ◽  
Optimal Solution ◽  
The State ◽  
Generation Process ◽  
Reachability Graph ◽  
Main Drawback ◽  
Low Efficiency

Protocol-level mismatch is one of the most important problems in service composition. The state-of-the-art method to deal with protocol mismatch is to generate adaptors to check deadlock-freeness based on a reachability graph. When this property is violated, the generation process will repeat itself until no deadlock state is found; however, the main drawback of this method is that it does not take into account the future deadlock state and requires many interactions with a developer. In this regard, it suffers from low efficiency. In this paper, the authors model multiple web service interaction with a Petri net called Composition net (C-net). The protocol-level mismatch problem is transformed into the empty siphon problem of a C-net. The authors take future deadlock states into consideration through this model, while finding the optimal solution that involves fewest interactions with a developer. The proposed method is proved to achieve higher efficiency for resolving protocol-level mismatch issues than traditional ones.

Modeling and Algorithms for QoS-Aware Service Composition in Virtualization-Based Cloud Computing

2013 ◽  
Vol E96.B (1) ◽  
pp. 10-19 ◽  
Author(s):  
Jun HUANG ◽  
Yanbing LIU ◽  
Ruozhou YU ◽  
Qiang DUAN ◽  
Yoshiaki TANAKA
Keyword(s):  
Cloud Computing ◽  
Service Composition

The Design and Implementation of a Service Composition System Based on a RESTful API

2019 ◽  
pp. 573-583
Author(s):  
Hui Wang ◽  
Guang-Yu Sun ◽  
Qin-Yan Zhang ◽  
Kai-Min Liu ◽  
Meng Xi ◽  
...  
Keyword(s):  
Service Composition ◽  
Design And Implementation

User-oriented Web service composition method

2009 ◽  
Vol 29 (11) ◽  
pp. 3120-3123 ◽  
Author(s):  
Peng LI ◽  
De-chen ZHAN ◽  
Guo-zhong LIU ◽  
Lan-shun NIE ◽  
Jin-dan FENG
Keyword(s):  
Web Service ◽  
Service Composition ◽  
Web Service Composition ◽  
Composition Method
Sign in / Sign up

Export Citation Format

Share Document