Web Services Compositions Modelling and Choreographies Analysis

In Rouached et al. (2006) and Rouached and Godart (2007) the authors described the semantics of WSBPEL by way of mapping each of the WSBPEL (Arkin et al., 2004) constructs to the EC algebra and building a model of the process behaviour. With these mapping rules, the authors describe a modelling approach of a process defined for a single Web service composition. However, this modelling is limited to a local view and can only be used to model the behaviour of a single process. The authors further the semantic mapping to include Web service composition interactions through modelling Web service conversations and their choreography. This paper elaborates the models to support a view of interacting Web service compositions extending the mapping from WSBPEL to EC, and including Web service interfaces (WSDL) for use in modelling between services. The verification and validation techniques are also exposed while automated induction-based theorem prover is used as verification back-end.

Download Full-text

Service Composition Verification and Validation

Service Life Cycle Tools and Technologies ◽

10.4018/978-1-61350-159-7.ch010 ◽

2013 ◽

pp. 200-219

Author(s):

Manuel Palomo-Duarte

Keyword(s):

Web Services ◽

Software Development ◽

Web Service ◽

Service Composition ◽

Web Service Composition ◽

Verification And Validation ◽

Loosely Coupled ◽

Program Testing ◽

Traditional Program ◽

Programming Systems

Web services are changing software development thanks to their loosely coupled nature and simple adoption. They can be easily composed to create new more powerful services, allowing for large programming systems. Verification and validation techniques try to find defects in a program to minimize losses that its malfunction could cause. Although many different approaches have been developed for “traditional” program testing, none of them have proven definitive. The problem is even more challenging for new paradigms like web services and web service compositions, because of their dynamic nature and uncommon web service-specific instructions. This chapter surveys the different approaches to web service and web service composition verification and validation, paying special attention to automation. When no tools are available for a given technique, academic efforts are discussed, and challenges are presented.

Download Full-text

Service Composition Verification and Validation

Software Design and Development ◽

10.4018/978-1-4666-4301-7.ch100 ◽

2014 ◽

pp. 2163-2182

Author(s):

Manuel Palomo-Duarte

Keyword(s):

Web Services ◽

Software Development ◽

Web Service ◽

Service Composition ◽

Web Service Composition ◽

Verification And Validation ◽

Loosely Coupled ◽

Program Testing ◽

Traditional Program ◽

Programming Systems

Web services are changing software development thanks to their loosely coupled nature and simple adoption. They can be easily composed to create new more powerful services, allowing for large programming systems. Verification and validation techniques try to find defects in a program to minimize losses that its malfunction could cause. Although many different approaches have been developed for “traditional” program testing, none of them have proven definitive. The problem is even more challenging for new paradigms like web services and web service compositions, because of their dynamic nature and uncommon web service-specific instructions. This chapter surveys the different approaches to web service and web service composition verification and validation, paying special attention to automation. When no tools are available for a given technique, academic efforts are discussed, and challenges are presented.

Download Full-text

Verification and Validation of Web Service Composition Using Event B Method

Lecture Notes in Computer Science - Abstract State Machines, B and Z ◽

10.1007/978-3-540-87603-8_28 ◽

2008 ◽

pp. 339-340 ◽

Cited By ~ 3

Author(s):

Idir Ait-Sadoune ◽

Yamine Ait-Ameur

Keyword(s):

Web Service ◽

Service Composition ◽

Web Service Composition ◽

Verification And Validation ◽

B Method ◽

Event B Method

Download Full-text

QoS–Aware Web Service Composition using Weight Improved Particle Swarm Optimization

Science & Technology Journal ◽

10.22232/stj.2021.09.02.07 ◽

2021 ◽

Vol 9 (2) ◽

pp. 65-70

Author(s):

Laishram Jenny Chanu ◽

◽

Arnab Paul ◽

Keyword(s):

Particle Swarm Optimization ◽

Web Services ◽

Web Service ◽

Optimization Algorithm ◽

Service Composition ◽

Particle Swarm Optimization Algorithm ◽

Particle Swarm ◽

Web Service Composition ◽

Swarm Optimization ◽

Complex Query

Lots of Web Services are available which differ in their QoS values but can perform a similar task. Discovery mechanism selects the best Web Service according to their QoS values and functional attributes. Cases arise, where the discovery mechanism fails, as a user’s complex query cannot be satisfied by a single Web Service. This can be solved by Web Service composition where multiple Web Services are combined to give a composite Web Service which meet user’s complex query. Our work is mainly focused on composition of Web Services that efficiently meets the user’s query. Different algorithms have been discussed and used by different researchers in this field. One of the most blooming topics is the use of evolutionary algorithms in optimization problems. In our work, we have chosen Particle Swarm Optimization Algorithm approach to discover the best efficient composition. Then, Weight Improved Particle Swarm Optimization Algorithm is used to improve the results which were found to be quite satisfying and efficient.

Download Full-text

WSBen

Web Technologies ◽

10.4018/978-1-60566-982-3.ch040 ◽

2011 ◽

pp. 739-758 ◽

Cited By ~ 1

Author(s):

Seog-Chan Oh ◽

Dongwon Lee

Keyword(s):

Statistical Analysis ◽

Web Services ◽

Web Service ◽

Service Composition ◽

Network Models ◽

Web Service Composition ◽

Ai Planning ◽

Underlying Network ◽

Test Sets ◽

Diverse Data

In this article, a novel benchmark toolkit, WSBen, for testing web services discovery and composition algorithms is presented. The WSBen includes: (1) a collection of synthetically generated web services files in WSDL format with diverse data and model characteristics; (2) queries for testing discovery and composition algorithms; (3) auxiliary files to do statistical analysis on the WSDL test sets; (4) converted WSDL test sets that conventional AI planners can read; and (5) a graphical interface to control all these behaviors. Users can finetune the generated WSDL test files by varying underlying network models. To illustrate the application of the WSBen, in addition, we present case studies from three domains: (1) web service composition; (2) AI planning; and (3) the laws of networks in Physics community. It is our hope that WSBen will provide useful insights in evaluating the performance of web services discovery and composition algorithms. The WSBen toolkit is available at: http://pike.psu.edu/sw/wsben/.

Download Full-text

Applying Evolutionary Many-Objective Optimization Algorithms to the Quality-Driven Web Service Composition Problem

Advances in Business Information Systems and Analytics - Automated Enterprise Systems for Maximizing Business Performance ◽

10.4018/978-1-4666-8841-4.ch010 ◽

2016 ◽

pp. 170-194

Author(s):

Arion de Campos Jr. ◽

Aurora T. R. Pozo ◽

Silvia R. Vergilio

Keyword(s):

Web Services ◽

Web Service ◽

Service Composition ◽

Optimization Algorithms ◽

Web Service Composition ◽

Nsga Ii ◽

Preference Relations ◽

Multi Objective ◽

Composition Problem

The Web service composition refers to the aggregation of Web services to meet customers' needs in the construction of complex applications. The selection among a large number of Web services that provide the desired functionalities for the composition is generally driven by QoS (Quality of Service) attributes, and formulated as a constrained multi-objective optimization problem. However, many equally important QoS attributes exist and in this situation the performance of the multi-objective algorithms can be degraded. To deal properly with this problem we investigate in this chapter a solution based in many-objective optimization algorithms. We conduct an empirical analysis to measure the performance of the proposed solution with the following preference relations: Controlling the Dominance Area of Solutions, Maximum Ranking and Average Ranking. These preference relations are implemented with NSGA-II using five objectives. A set of performance measures is used to investigate how these techniques affect convergence and diversity of the search in the WSC context.

Download Full-text

A Novel Physics Inspired Approach for Web Service Composition

International Journal of Web Services Research ◽

10.4018/ijwsr.2014040104 ◽

2014 ◽

Vol 11 (2) ◽

pp. 67-84 ◽

Cited By ~ 1

Author(s):

Tanveer Ahmed ◽

Abhishek Srivastava

Keyword(s):

Web Services ◽

Web Service ◽

Service Composition ◽

Service Oriented Architecture ◽

Service Providers ◽

Web Service Composition ◽

Heterogeneous Services ◽

Service Oriented ◽

Service Consumer ◽

Selection Of

Service oriented architecture has revolutionized the way a traditional business process is executed. The success of this architecture is Indue to the composition of multiple heterogeneous services at runtime. Web service composition is a mechanism where several web services are combined at runtime to build a complex application for a user. It is one of the most sought after processes in the context of semantic web. But, composition of web services at runtime is a difficult task owing to the availability of multiple service providers offering the same functionality. The process if exasperated by due conflicting preferences of a service consumer. In this paper, the authors address the issue of selecting a service based on Quality of Service (QoS) attributes. They utilize concepts customized from physics to create an environment that facilitates the selection of a best service from the set of similar services. The technique not only facilitates the selection of the service with the best QoS attributes, but distributes the load among expeditiously. Here in this paper, the authors concentrate on minimizing and equitably balancing the waiting time for a user. They conduct in silico experiments on multiple workflows to demonstrate the efficacy of the proposed technique to balance load efficiently among similar service offerings.

Download Full-text