Theoretical Computer Science
Simulation, verification and automated composition of web services
Proceedings of the 11th international conference on World Wide Web
Conversation specification: a new approach to design and analysis of e-service composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
A Petri net-based model for web service composition
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Automatic composition of transition-based semantic web services with messaging
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Representing, analysing and managing web service protocols
Data & Knowledge Engineering - Special issue: ER 2004
A survey on web services composition
International Journal of Web and Grid Services
Journal of Computer and System Sciences
A lower bound on web services composition
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Automatic behavior composition synthesis
Artificial Intelligence
| Hi-index | 0.00 |
We study the problem of web service protocol composition. We consider a formal framework where service business protocols are described by means of Finite State Machines (FSM) and focus on the protocol synthesis problem, i.e., how to generate automatically a new target service protocol by reusing some existing ones. We consider a general case of this problem where the number of instances of existing services that can be used in a given composition is not bounded a priori . We motivate the practical interest of investigating such a problem and then we prove its decidability by providing a sound and complete composition algorithm. Since the main composition algorithm is not primitive recursive, which means that no theoretical complexity bound can be computed, we evaluated experimentally the performance of the algorithm on synthetic data instances and present preliminary results in this paper.