Composition of Services with Constraints

Authors:
Philippe Balbiani;Fahima Cheikh Alili;P. -C. Héam;Olga Kouchnarenko
Affiliations:
IRIT-CNRS, Toulouse, France;IRIT-CNRS, Toulouse, France;LSV-CNRS-INRIA, Cachan, France;INRIA-CASSIS-LIFC, Besançon, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 11
Cited 0

Complexity of equivalence problems for concurrent systems of finite agents

Information and Computation
Analysis of interacting BPEL web services

Proceedings of the 13th international conference on World Wide Web
Automatic composition of transition-based semantic web services with messaging

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Automated Synthesis of Composite BPEL4WS Web Services

ICWS '05 Proceedings of the IEEE International Conference on Web Services
Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach

ECOWS '06 Proceedings of the European Conference on Web Services
How to Handle QoS Aspects in Web Services Substitutivity Verification

WETICE '07 Proceedings of the 16th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
The equivalence problem for regular expressions with squaring requires exponential space

SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Web service composition as planning, revisited: in between background theories and initial state uncertainty

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Automated composition of web services by planning at the knowledge level

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A lower bound on web services composition

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
ASTRO: supporting composition and execution of web services

ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Composition of Web services consists of the interleaving of the sequence of actions executed by the elementary services in accordance with a client specification. We model Web services as automata executing actions and also sending and receiving messages. This paper provides a theoretical study for three service composition problems, and in particular for the problem of computing a Boolean formula which exactly characterises the conditions required for services to answer the client's request. New complexity results are established for these problems within the framework of service composition with constraints.