Abstract
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.
Chapter PDF
References
Alonso, G., Casati, F., Kuno, H.A., Machiraju, V.: Web Services - Concepts, Architectures and Applications. Springer, Heidelberg (2004)
Bultan, T., Fu, X., Hull, R., Su, J.: Conversation specification: a new approach to design and analysis of e-service composition. In: WWW 2003. ACM, New York (2003)
Dustdar, S., Schreiner, W.: A survey on web services composition. International Journal of Web and Grid Services 1(1), 1–30 (2005)
Berardi, D., Calvanese, D., Giacomo, G.D., Lenzerini, M., Mecella, M.: Automatic service composition based on behavioral descriptions. IJCIS 14(4), 333–376 (2005)
Berardi, D., Calvanese, D., Giacomo, G.D., Hull, R., Mecella, M.: Automatic composition of transition-based semantic web services with messaging. In: VLDB, pp. 613–624 (2005)
Muscholl, A., Walukiewicz, I.: A lower bound on web services composition. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 274–286. Springer, Heidelberg (2007)
Narayanan, S., McIlraith, S.: Simulation, verification and automated composition of web services. In: WWW 2002, pp. 77–88 (2002)
Hamadi, R., Benatallah, B.: A Petri net-based model for web service composition. In: Australasian Database Conference, pp. 191–200 (2003)
Traverso, P., Pistore, M.: Automated Composition of Semantic Web Services into Executable Processes. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 380–394. Springer, Heidelberg (2004)
McIlraith, S., Son, T.: Adapting Golog for Composition of Semantic Web Services. In: KR 2002, pp. 482–493 (2002)
Benatallah, B., Casati, F., Toumani, F.: Representing, analysing and managing web service protocols. DKE 58(3), 327–357 (2006)
Jedrzejowicz, J., Szepietowski, A.: Shuffle languages are in p. TCS 250(1-2), 31–53 (2001)
Warmuth, M.K., Haussler, D.: On the complexity of iterated shuffle. JCSS 28(3), 345–358 (1984)
Karp, R., Miller, R.: Parallel Program Schemata. JCSS 3(2), 147–195 (1969)
Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. Journal Math. 35, 413–422 (1913)
Ragab, R., Nourine, L., Toumani, F.: Web services composition is decidable, http://www.isima.fr/ragab/RNTReport08.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ragab Hassen, R., Nourine, L., Toumani, F. (2008). Protocol-Based Web Service Composition. In: Bouguettaya, A., Krueger, I., Margaria, T. (eds) Service-Oriented Computing – ICSOC 2008. ICSOC 2008. Lecture Notes in Computer Science, vol 5364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89652-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-89652-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89647-0
Online ISBN: 978-3-540-89652-4
eBook Packages: Computer ScienceComputer Science (R0)