Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Protocol-Based Web Service Composition
verfasst von : Ramy Ragab Hassen, Lhouari Nourine, Farouk Toumani
Erschienen in: Service-Oriented Computing – ICSOC 2008
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.