Web Services Composition Problem

2013 ◽  
pp. 1400-1424
Author(s):  
Fahima Cheikh

In the approach taken in this chapter, the composition problem is as follows: given a client service, a goal service and a set of available services, determine if there exists a mediator service that enables the communication between the client and the existing services in order to satisfy the client request, represented by the goal service. In this chapter’s model, available services that have access control constraints are considered. To formally capture these constraints, the chapter defines Web Services as Conditional Communicating Automata (CCA) in which communication is done through bounded ports. This chapter gives a detailed presentation of said model and gives complexity results of the composition problem.

Author(s):  
Fahima Cheikh

In the approach taken in this chapter, the composition problem is as follows: given a client service, a goal service and a set of available services, determine if there exists a mediator service that enables the communication between the client and the existing services in order to satisfy the client request, represented by the goal service. In this chapter’s model, available services that have access control constraints are considered. To formally capture these constraints, the chapter defines Web Services as Conditional Communicating Automata (CCA) in which communication is done through bounded ports. This chapter gives a detailed presentation of said model and gives complexity results of the composition problem.


2011 ◽  
Vol 8 (2) ◽  
pp. 53-73 ◽  
Author(s):  
Jiuyun Xu ◽  
Kun Chen ◽  
Stephan Reiff-Marganiec

Automatic Web services composition can be achieved using AI planning techniques. HTN planning has been adopted to handle the OWL-S Web service composition problem. However, existing composition methods based on HTN planning have not considered the choice of decompositions available to a problem, which can lead to a variety of valid solutions. In this paper, the authors propose a model of combining a Markov decision process model and HTN planning to address Web services composition. In the model, HTN planning is enhanced to decompose a task in multiple ways and find more than one plan, taking into account both functional and non-functional properties. Furthermore, an evaluation method to choose the optimal plan and experimental results illustrate that the proposed approach works effectively. The paper extends previous work by refining a number of aspects of the approach and applying it to a realistic case study.


2011 ◽  
Vol 22 (11) ◽  
pp. 2698-2715 ◽  
Author(s):  
Fang-Xiong XIAO ◽  
Zhi-Qiu HUANG ◽  
Zi-Ning CAO ◽  
Li-Zhong TU ◽  
Yi ZHU

2006 ◽  
Vol 5 (5) ◽  
pp. 1-10 ◽  
Author(s):  
Seog-Chan Oh ◽  
Dongwon Lee ◽  
Soundar R. T. Kumara

Sign in / Sign up

Export Citation Format

Share Document