Please use this identifier to cite or link to this item:
Title: Complexity and composition of synthesized web services
Authors: Fan, Wenfei
GEERTS, Floris 
GELADE, Wouter 
NEVEN, Frank 
Poggi, Antonella
Issue Date: 2008
Publisher: ACM
Source: Lenzerini, Maurizio & Lembo, Domenico (Ed.) Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. p. 231-240.
Abstract: The paper investigates fundamental decision problems and composition synthesis for Web services commonly found in practice. We propose a notion of synthesized Web services (SWS's)to specify the behaviors of the services. Upon receiving a sequence of input messages, an SWS issues multiple queries to a database and generates actions, in parallel; it produces external messages and database updates by synthetisizing the actions parallelly generated. In contrast to previous models for Web services, SWS's advocate parallel processing and (deterministic) synthesis of actions. We classify SWS's based on what queries an SWS can issue, how the synthesis of actions is expressed, and whether unbounded input sequences are allowed in a single interaction session. We show that the behaviors of Web services supported by various prior models, data driven or not, can be specified by different SWS classes. For each of these classes we study the non-emptiness, validation and equivalence problems, and establish matching upper and lower bounds on these problems. We also provide complexity bounds on composition synthesis for these SWS classes, identifying decidable cases.
Document URI:
Link to publication:
ISBN: 978-1-60558-108-8
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
pods08.pdfPreprint239.65 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 19, 2022


checked on May 19, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.