Abstract Reachability Graph for Verifying Web Service Interfaces

2008 ◽  
pp. 262-265 ◽  
Author(s):  
Xutao Du ◽  
Chunxiao Xing ◽  
Lizhu Zhou
Keyword(s):  
Web Service ◽  
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.

Gifts from the Web: Service Learning

2005 ◽  
Vol 8 (1) ◽  
pp. 16-18
Author(s):  
Howard F. Wilson
Keyword(s):  
Service Learning ◽  
Web Service ◽  
The Web

Different Syntactic Methods and Clustering For Web Service Integration

2015 ◽  
Vol 03 (01) ◽  
pp. 357-362 ◽  
Author(s):  
PRAVEENKUMAR ARJUN PATEL ◽  
PROF. UMESH LAXMAN KULKARNI
Keyword(s):  
Web Service ◽  
Service Integration

Parallelizing Web Service Upload \ Download files

2018 ◽  
Vol 8 (3) ◽  
pp. 15
Author(s):  
Mustapha Mohammed Baua'a
Keyword(s):  
Web Services ◽  
Response Time ◽  
Web Service ◽  
File System ◽  
Programming Environment

The I\O file system Read\Write operations are considered the most significant characteristics. Where, many researchers focus on their works on how to decrease the response time of I\O file system read\write operations. However, most articles concentrate on how to read\write content of the file in parallelism manner. Here in this paper, the author considers the parallelizing Read\Write whole file bytes not only its contents. A case study has been applied in order to make the idea more clear. It talks about two techniques of uploading\downloading files via Web Service. The first one is a traditional way where the files uploaded and downloaded serially. While the second one is uploaded\ downloaded files using Java thread in order to simulate parallelism technique. Java Netbeans 8.0.2 have been used as a programming environment to implement the Download\Upload files through Web Services. Validation results are also presented via using Mat-lab platform as benchmarks. The visualized figures of validation results are clearly clarifying that the second technique shows better response time in comparison to the traditional way.

A Study on Different Web Service Discovery Approaches

2018 ◽  
Vol 6 (9) ◽  
pp. 311-314
Author(s):  
Rahul P. Mirajkar ◽  
Nikhil D. Karande ◽  
Surendra Yadav
Keyword(s):  
Web Service ◽  
Service Discovery ◽  
Web Service Discovery
Sign in / Sign up

Export Citation Format

Share Document