Abstract
How to compose existing web services automatically and to guarantee the correctness of the design (e.g. freeness of deadlock and unspecified reception, and temporal constraints) is an important and challenging problem in web services. Most existing approaches require a detailed specification of the desired behaviors of a composite service beforehand and then perform certain formal verification to guarantee the correctness of the design, which makes the composition process both complex and time-consuming. In this paper, we propose a novel approach, referred to as AutoSyn to compose web services, where the correctness is guaranteed in the synthesis process. For a given set of services, a composite service is automatically constructed based on L* algorithm, which guarantees that the composite service is the most general way of coordinating services so that the correctness is ensured. We show the soundness and completeness of our solution and give a set of optimization techniques for reducing the time consumption. We have implemented a prototype system of AutoSyn and evaluated the effectiveness and efficiency of AutoSyn through an experimental study.
Similar content being viewed by others
References
Hull R, Su J. Tools for composite web services: a short overview. SIGMOD Rec, 2005, 34(2): 86–95
Berardi D, Calvanese D, Giacomo G, et al. Automatic composition of transition-based semantic web services with messaging. In: Proceeding of 31th International Conference on Very Large Databases, Trondheim, Norway, 2005. 613–624
Fu X, Bultan T, Su J. Conversation protocols: a formalism for specification and verification of reactive electronic services. Theor Comput Sci, 2004, 328(1–2): 19–37
Probert R L, Saleh K. Synthesis of communication protocols: Survey and assessment. IEEE Trans Comput, 1991, 40(4): 468–476
Magee J, Kramer J, Uchitel S, et al, LTSA-WS: a tool for model-based verification of web service compositions and choreography, In: Proceeding of International Conference on Software Engineering, Shanghai, China, 2006. 771–774
Rintanen J. Computational complexity of plan and controller synthesis under partial observability. Technical Report, 2005. http://users.rsise.anu.edu.au/jussi/Rintanen05compl.pdf.
Pistore M, Traverso P, Bertoli P, et al. Automated synthesis of composite bpel4ws web services. In: Proceeding of International Conference on Web Services, Orlando, Florida, USA, 2005. 293–301
Rivest R L, Schapire R E. Inference of finite automata using homing sequences. Inf Comput, 1993, 103(2): 299–347
Clarke E M, Grumberg O, Peled D A. Model Checking. Cambridge, MA: MIT Press, 2000
Manolios P, Trefler R J. Safety and liveness in branching time. In: Proceeding of 16th Annual IEEE Symposium on Logic in Computer Science, Boston, MA, USA, 2001. 366–374
Garey M R, Johnson, D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman W. H. & Co., 1990
Alur R, Cerny P, Madhusudan P, et al. Synthesis of interface specifications for java classes. In: Proceeding of Symposium on Principles of Programming Languages, Long Beach, California, USA, 2005. 98–109
Milner R. Communicating and Mobile Systems: the Pi-Calculus. Cambridge: Cambridge University Press, 1999
Berg T, Jonsson B, Leucker M, et al. Insights to angluin’s learning. In: Proceeding of International Workshop on Software Verification and Validation, Mumbai, India, 2003
Wombacher A, Fankhauser P, Neuhold E J. Transforming bpel into annotated deterministic finite state automata for service discovery. In: Proceeding of International Conference of Web Services, San Diego, California, USA, 2004. 316–323
Berardi D, Calvanese D, Giacomo G D, et al. εSC: A tool for automatic composition of services based on logics of programs. In: Proceeding of Workshop on Technologies for E-Services, Toronto, Canada, 2004. 80–94
Cobleigh J M, Giannakopoulou D, Pasareanu C S. Learning assumptions for compositional verification. In: Proceeding of International Conference on Tools and algorithms for the Construction and Analysis of Systems, Warsaw, Poland, 2003. 331–346
Berardi D, Calvanese D, Giacomo G, et al. Automatic composition of e-services that export their behavior. In: Proceeding of International Conference on Service Oriented Computing, Trento, Italy, 2003. 43–58
Fan W, Geerts F, Gelade W. Complexity and composition of synthesized web services. In: Proceeding of Symposium on Principles of Database Systems, Vancourver, Canada, 2008. 231–240
Pathak J, Basu S, Lutz R, et al. Parallel web service composition in moscoe: A choreography-based approach. In: Proceeding of European Conference on Web Services, Zurich, Switzerland, 2006. 3–12
Mitra S, Kumar R, Basu S. Automated choreographer synthesis for web services composition using i/o automata. In: Proceeding of International Conference on Web Services, Salt Lake City, Utah, USA, 2007. 364–371
Marconi A, Pistore M, Traverso P. Specifying data-flow requirements for the automated composition of web services. In: Proceeding of IEEE International Conference on Software Engineering and Formal Methods, Pune, India, 2006. 147–156
Ponnekanti S, Fox A. Sword: A developer toolkit for web service composition. In: Proceeding of World Wide Web Conference, Honolulu, Hawaii, USA, 2002
Sirin E, Parsia B, Wu D, et al. HTN planning for web service composition using shop2. J Web Semant, 2004, 1(4): 377–396
Pu K, Hristidis V, Koudas N. Syntactic rule based approach toweb service composition. In: Proceeding of International Conference on Data Engineering, Atlanta, Georgia, USA, 2006. 31–40
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National High-Tech Research & Development Program of China (Grant No. 2007AA010301), the National Basic Research Program of China (Grant No. 2005CB321803), the National Natural Science Foundation of China for Distinguished Young Scholar (Grant No. 60525209), the National Natural Science Foundation of China (NSFC)/Research Grants Council (RGC) Joint Research Project (Grant No. 60731160632), and the Program for New Century Excellent Talents in University (Grant No. NCET-05-0186)
Rights and permissions
About this article
Cite this article
Huai, J., Deng, T., Li, X. et al. AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee. Sci. China Ser. F-Inf. Sci. 52, 1534–1549 (2009). https://doi.org/10.1007/s11432-009-0155-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-009-0155-0