An Efficient Web Service Composition Method Based on the Price-Time Petri Net

2011 ◽  
Vol 268-270 ◽  
pp. 1421-1426
Author(s):  
Xian Wen Fang ◽  
Yan Ni Zou ◽  
Qian Jin Zhao

At present, developers can rapidly generate applications through Web service composition, the quality of service (QoS) of web service composition is important, but most of the existing composition methods are difficult to balance the QoS indexes (Such as time and price). In this paper, a web service composition method based on the price-time Petri net is proposed, the minimum cost can be obtained by modeling based on price time Petri net, and presents a method of priced state class to analyze the cost of web service composition model. Theoretical analysis and case analysis show that the price-time Petri net method is feasible to study Web service composition with the minimum cost.

2010 ◽  
Vol 20-23 ◽  
pp. 220-225 ◽  
Author(s):  
Bo Yang ◽  
Shun Lin Song

By analyzing the existing Web service composition,a automatic composition method of Web Service based on Petri net was been proposed. This paper primarily extended the Petri net’s tokens, which been expressed as the parameters of atomic services (the services can not be decomposed), as a model for Web services. Then the improved Web service composition method was used to compose the atomic services, making them flowing in the Petri net in accordance with the relationship between the composition of atomic services, and verify the correctness of the service. Finally a specific example was used to analyze and realize the service modeling and automatic composition process of Web service.


2018 ◽  
Vol 14 (2) ◽  
pp. 113-137 ◽  
Author(s):  
Fella Bey ◽  
Samia Bouyakoub ◽  
Abdelkader Belkhir

This article describes how incorporating temporal constraints in web service composition results in more complex models and makes the verification of temporal consistency during the modeling and execution crucial. This article proposes a model named H-Service-Net based on the time petri net model to control and manage temporal consistency; the model also supports time constraints and exception handling. First, this approach proposes a modular approach for modeling composition using Extend Time Unit System, Allen's interval algebra, and comparison operators in a time petri net model to consider all types of temporal constraints. Subsequently, this article presents algorithms on checking temporal consistency and mechanism for exception handling and validating the system in an implementation tool (H-Service-Editor) based on the proposed approach that uses BizTalk Server 2013 to evaluate the implementation of temporal constraints and timeout exception handling. Finally, an exhaustive performance experiment is presented to assess the scalability of the authors' approach.


2009 ◽  
Vol 29 (11) ◽  
pp. 3120-3123 ◽  
Author(s):  
Peng LI ◽  
De-chen ZHAN ◽  
Guo-zhong LIU ◽  
Lan-shun NIE ◽  
Jin-dan FENG

Author(s):  
W. Du ◽  
H. Fan ◽  
J. Li ◽  
H. Wang

A lot of work has been done on the geospatial service composition to support advanced processing, spatial calculation, and invoking of heterogeneous data. However, the quality of service chain is rarely considered and the process model cannot be reused. A modeldriven way of geospatial web service composition is proposed in this work, the service composition is treated as an optimization problem by <i>GwcsFlow</i> model and dynamic binding mechanism. The case of facility location analysis is provided to demonstrate the improvements in geospatial service composition through optimization algorithms.


Author(s):  
Arion de Campos Jr. ◽  
Aurora T. R. Pozo ◽  
Silvia R. Vergilio

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.


Sign in / Sign up

Export Citation Format

Share Document