Web Services Composition Problem-Reference-Cited by-同舟云学术

Web Services Composition Problem

Published:2011 Issue: Volume: Page:175-198
ISSN:2328-2762
Container-title:Engineering Reliable Service Oriented Architecture
language:
Short-container-title:

Author:

Cheikh Fahima¹

Affiliation:

1. Université de Toulouse, France

Abstract

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.

Publisher

IGI Global

Reference30 articles.

1. Games for synthesis of controllers with partial observation

2. Balbiani, P., Cheikh, F., & Feuillade, G. (2007). Considérations relatives à la décidabilité et à la complexité du problème de la composition de services. In Journées Francophones modèle formels de l’interaction, 261–268. Annales du LAMSADE.

3. Balbiani, P., Cheikh, F., & Feuillade, G. (2008). Composition of interactive Web Services based on controller synthesis. In Proceedings of the 2nd International Workshop on Web Service Composition and Adaptation. Honolulu, USA: IEEE.

4. Balbiani, P., Cheikh, F., & Feuillade, G. (2008). Composition of Web Services: Algorithms and complexity. In Proceedings of The 1st Interaction and Concurrency Experience. Reykjavik, Iceland: ENTCS.

5. Berardi, D., Calvanese, D., De Giacomo, G., Hull, R., & Mecella, M. (2005). Automatic composition of transition-based Semantic Web Services with messaging. In Proceedings of the 31st International Conference on Very Large Data Bases, (pp.613–624). Trondheim, Norway: ACM.