Automatic Composition of e-Services

The main focus of this paper is on automatic e-Service composition. We start by developing a framework in which the exported behavior of an e-Service is described in terms of its possible executions (execution trees). Then we specialize the framework to the case in which such exported behavior (i.e., the execution tree of the e-Service) is represented by a finite state machine. In this specific setting, we analyze the complexity of synthesizing a composition, and develop sound and complete algorithms to check the existence of a composition and to return one such a composition if one exists. To the best of our knowledge, our work is the first attempt to provide an algorithm for the automatic synthesis of e-Service composition, that is both proved to be correct, and has an associated computational complexity characterization.

[1]  Mike P. Papazoglou,et al.  Tackling the challenges of service composition in e-marketplaces , 2002, Proceedings Twelfth International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems RIDE-2EC 2002.

[2]  Mike P. Papazoglou,et al.  Agent-oriented technology in support of e-business , 2001, CACM.

[3]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[4]  Diego Calvanese,et al.  Reasoning in Expressive Description Logics , 2001, Handbook of Automated Reasoning.

[5]  Massimo Mecella,et al.  Building Flexible and Cooperative Applications Based on e-Services , 2002 .

[6]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  Sheila A. McIlraith,et al.  Simulation, verification and automated composition of web services , 2002, WWW.

[8]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[9]  Fabio Casati,et al.  Dynamic and adaptive composition of e-services , 2001, Inf. Syst..

[10]  Mike P. Papazoglou,et al.  Service Representation, Discovery, and Composition for E-marketplaces , 2001, CoopIS.

[11]  Massimo Mecella,et al.  Compatibility of e -Services in a Cooperative Multi-platform Environment , 2001, TES.

[12]  Mike P. Papazoglou,et al.  Web Component: A Substrate for Web Service Reuse and Composition , 2002, CAiSE.

[13]  Andrzej Cichocki,et al.  Modeling and Composing Service-Based nd Reference Process-Based Multi-enterprise Processes , 2000, CAiSE.

[14]  Gerhard Weikum,et al.  XML-enabled workflow management for e-services across heterogeneous platforms , 2001, The VLDB Journal.

[15]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[16]  Hye-Young Paik,et al.  Peer-to-Peer Traced Execution of Composite Services , 2001, TES.

[17]  Thomi Pilioura,et al.  E-Services: Current Technology and Open Issues , 2001, TES.

[18]  Jerry R. Hobbs,et al.  DAML-S: Web Service Description for the Semantic Web , 2002, SEMWEB.

[19]  Xiang Fu,et al.  Conversation specification: a new approach to design and analysis of e-service composition , 2003, WWW '03.

[20]  Marco Pistore,et al.  A Request Language for Web-Services Based on Planning and Constraint Satisfaction , 2002, TES.

[21]  Tran Cao Son,et al.  Adapting Golog for Composition of Semantic Web Services , 2002, KR.

[22]  Massimo Mecella,et al.  Finite State Automata as Conceptual Model for E-Services , 2004, Trans. SDPS.

[23]  Dickson K. W. Chiu,et al.  View-Based Contracts in an E-Service Cross-Organizational Workflow Environment , 2001, TES.

[24]  Jianwen Su,et al.  E-services: a look behind the curtain , 2003, PODS.

[25]  Mordechai Ben-Ari,et al.  Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness , 1982, J. Comput. Syst. Sci..

[26]  Diego Calvanese,et al.  A Foundational Vision of e-Services , 2003, WES.