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 (ASTs) to specify the behaviors of the services. Upon receiving a sequence of input messages, an AST issues multiple queries to a database and generates actions, in parallel; it produces external messages and database updates by synthesizing the actions parallelly generated. In contrast to previous models for Web services, ASTs advocate parallel processing and (deterministic) synthesis of actions. We classify ASTs based on what queries an AST 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 AST 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 AST classes, identifying decidable cases.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.]] Google Scholar
Digital Library
- S. Abiteboul, V. Vianu, B.S. Fordham, and Y. Yesha. Relational transducers for electronic commerce. JCSS, 61(2):236--269, 2000.]] Google Scholar
Digital Library
- F.N. Afrati, M. Gergatsoulis, and T.G. Kavalieros. Answering queries using materialized views with disjunctions. In ICDT, 1999.]] Google Scholar
Digital Library
- F.N. Afrati, C. Li, and P. Mitra. Rewriting queries using views in the presence of arithmetic comparisons. Theor. Comput. Sci., 368(1-2):88--123, 2006.]] Google Scholar
Digital Library
- D. Berardi, D. Calvanese, G.D. Giacomo, R. Hull, and M. Mecella. Automatic composition of transition-based semantic web services with messaging. In VLDB, 2005.]] Google Scholar
Digital Library
- D. Berardi, D. Calvanese, G.D. Giacomo, M. Lenzerini, and M. Mecella. Automatic service composition based on behavioral descriptions. Int. J. Cooperative Inf. Syst., 14(4):333--376, 2005.]]Google Scholar
Cross Ref
- Business Process Execution Language for Web Services version 1.1 (BEPL4WS), 2004. http://www.ibm.com/developerworks/library/specification/ws-bpel/]]Google Scholar
- D. Calvanese, G.D. Giacomo, M. Lenzerini, and M. Y. Vardi. Rewriting of regular expressions and regular path queries. JCSS, 64(3):443--465, 2002.]]Google Scholar
Digital Library
- D. Calvanese, G.D. Giacomo, and M.Y. Vardi. Decidable containment of recursive queries. TCS, 336(1):33--56, 2005.]] Google Scholar
Digital Library
- S. Chaudhuri and M.Y. Vardi. On the equivalence of recursive and nonrecursive datalog programs. JCSS, 54(1):61--78, 1997.]]Google Scholar
Digital Library
- S.S. Cosmadakis and P.C. Kanellakis. Parallel evaluation of recursive rule queries. In PODS, 1986.]] Google Scholar
Digital Library
- A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven Web applications. JCSS, 73(3):442--474, 2007.]] Google Scholar
Digital Library
- A. Deutsch, L. Sui, V. Vianu, and D. Zhou. Verification of communicating data-driven Web services. In PODS, 2006.]] Google Scholar
Digital Library
- O.M. Duschka and M.R. Genesereth. Answering recursive queries using views. In PODS, 1997.]] Google Scholar
Digital Library
- X. Fu, T. Bultan, and J. Su. Analysis of interacting BPEL Web services. In WWW, 2004.]] Google Scholar
Digital Library
- X. Fu, T. Bultan, and J. Su. Conversation protocols: a formalism for specification and verification of reactive electronic services. TCS, 328(1-2):19--37, 2004.]] Google Scholar
Digital Library
- M. Garey and D. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, 1979.]] Google Scholar
Digital Library
- C.E. Gerede, R. Hull, O.H. Ibarra, and J. Su. Automated composition of e-services: lookaheads. In ICSOC, 2004.]] Google Scholar
Digital Library
- G. Gottlob and C. Papadimitriou. On the complexity of single rule datalog queries. Inf. Comput., 183(1):104--122, 2003.]] Google Scholar
Digital Library
- A. Y. Halevy. Theory of answering queries using views. SIGMOD Record, 29(4), 2001.]] Google Scholar
Digital Library
- R. Hull and J. Su. Tools for composite web services: a short overview. SIGMOD Record, 34(1):5--12, 2005.]] Google Scholar
Digital Library
- A. Klug. On conjunctive queries containing inequalities. J. ACM, 35(1):146--160, 1988.]] Google Scholar
Digital Library
- A. Levy, A.O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS, 1995.]] Google Scholar
Digital Library
- A. Muscholl and I. Walukiewicz. A lower bound on Web services composition. In FoSSaCS, 2007.]] Google Scholar
Digital Library
- OWL-S: Semantic Markup for Web Services, 2004. http://www.w3.org/Submission/OWL-S/.]]Google Scholar
- M. Pistore, P. Traverso, P. Bertoli, and A. Marconi. Automated synthesis of composite BPEL4WS web services. In ISWC, 2005.]] Google Scholar
Digital Library
- Semantic Web Services Framework (SWSF) Version 1.1, 2005. http://www.daml.org/services/swsf/1.1/.]]Google Scholar
- M. Spielmann. Abstract State Machines: Verification Problems and Complexity. PhD thesis, RWTH , 2000.]]Google Scholar
- M. Spielmann. Verification of relational transducers for electronic commerce. JCSS, 66(1):40--65, 2003.]] Google Scholar
Digital Library
- Web Services Conversation Language (WSCL) 1.0, 2002. http://www.w3.org/TR/wscl10/.]]Google Scholar
- Web Services Description Language (WSDL) 1.1, 2001. http://www.w3.org/TR/wsdl.]]Google Scholar
- S. Yu. Regular languages. In Handbook of Formal Languages, volume 1. Springer, 1996.]]Google Scholar
Index Terms
Complexity and composition of synthesized web services
Recommendations
Composition of Interactive Web Services Based on Controller Synthesis
SERVICES '08: Proceedings of the 2008 IEEE Congress on Services - Part IWe study an abstract form of service composition where Web services are represented as nondeterministic communicating automata. Considering the case in which communication is done via channels able to hold at most one message at a time, the service ...
Web services discovery and constraints composition
RR'07: Proceedings of the 1st international conference on Web reasoning and rule systemsThe most promising feature of the Web services platform is its ability to form new (composite) services by combining the capabilities of already existing (component) services. The existing services may themselves be composite leading to a hierarchical ...
Dynamic Web Service Composition: A New Approach in Building Reliable Web Service
AINA '08: Proceedings of the 22nd International Conference on Advanced Information Networking and ApplicationsThe use of services, especially Web services, became a common practice. In Web services, standard communication protocols and simple broker-request architectures are needed to facilitate exchange of services, and this standardization simplifies ...






Comments