Skip to main content
SpringerLink
Log in

Complexity of synthesis of composite service with correctness guarantee

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

How to compose existing web services automatically and to guarantee the correctness of the design (e.g. temporal constraints specified by temporal logic LTL, CTL or CTL*) is an important and challenging problem in web services. Most existing approaches use the process in conventional software development of design, verification, analysis and correction to guarantee the correctness of composite services, which makes the composition process both complex and time-consuming. In this paper, we focus on the synthesis problem of composite service; that is, for a given set of services and correctness constraint specified by CTL or CTL* formula, a composite service is automatically constructed which guarantees that the correctness is ensured. We prove that the synthesis problem for CTL and CTL* are complete for EXPTIME and 2EXPTIME, respectively. Moreover, for the case of synthesis failure, we discuss the problem of how to disable outputs of environment (i.e. users or services) reasonably to make synthesis successful, which are also proved complete for EXPTIME and 2EXPTIME for CTL and CTL*, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Hull R, Su J W. Tools for composite web services: a short overview. SIGMOD Rec, 2005, 34: 86–95

    Article  Google Scholar 

  2. Berardi D, Calvanese D, Giacomo G D, et al. Automatic composition of e-services that export their behavior. In: Orlowska M E, Weerawarana S, Papazoglou M P, et al., eds. Proceedings of International Conference on Service Oriented Computing. Trento: Springer, 2003. 43–58

    Google Scholar 

  3. Berardi D, Calvanese D, Giacomo G D, et al. Automatic composition of transition-based semantic web services with messaging. In: Bohm K, Jensen C S, Haas L M, et al., eds. Proceedings of International Conference on Very Large Data Bases. Trondheim: ACM, 2005. 613–624

    Google Scholar 

  4. Fan W, Geerts F, Gelade W, et al. Complexity and composition of synthesized web services. In: Lenzerini M, Lembothe D, eds. Proceedings of 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. Vancouver BC: ACM, 2008. 231–240

    Google Scholar 

  5. Mitra S, Kumar R, Basu S. Automated choreographer synthesis for web services composition using i/o automata. In: Leymann F, Shan M C, eds. Proceeding of International Conference on Web Services. Salt Lake City: IEEE Computer Society, 2007. 364–371

    Google Scholar 

  6. Fu X, Bultan T, Su J. Realizability of conversation protocols with message contents. In: Zhang L J, ed. Proceeding of IEEE International Conference on Web Services(ICWS). San Diego: IEEE Computer Society, 2004. 96–103

    Google Scholar 

  7. Fu X, Bultan T, Su J. Analysis of interacting BPEL web services. In: Feldman S I, Uretsky M, Najork M, et al., eds. Proceedings of the 13th International Conference on World Wide Web. New York: ACM, 2004. 621–630

    Google Scholar 

  8. Deutsch A, Sui L, Vianu V, et al. Verification of communicating data-driven web services. In: Vansummeren S, ed. Proceedings of the 25th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Chicago: ACM, 2006. 90–99

    Google Scholar 

  9. Manna Z, Waldinger R. A deductive approach to program synthesis. ACM Trans Progr Lang Sys (TOPLAS), 1980, 2: 90–121

    Article  MATH  Google Scholar 

  10. Emerson E A, Clarke E M. Using branching time logic to synthesize synchronization skeletons. Sci Comput Program, 1982, 2: 241–266

    Article  MATH  Google Scholar 

  11. Pnueli A, Rosner R. On the synthesis of a reactive module. In: Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages. Austin: ACM, 1989. 179–190

    Google Scholar 

  12. Pnueli A, Rosner R. On the synthesis of an asynchronous reactive module. In: Ausiello G, Ciancaglini M D, Rocca S, eds. Proceeding 16th International Colloquium on Automata, Languages, and Programs. Stresa: Springer, 1989. 652–671

    Chapter  Google Scholar 

  13. Kupferman O, Vardi M Y. Synthesis with incomplete information. In: Proceeding of 2nd International Conference on Temporal Logic. Manchester: Kluwer, 1997. 91–106

    Google Scholar 

  14. Finkbeiner B, Schewe S. Uniform distributed synthesis. In: Jagadeesan R, Jeffrey A, eds. Proceedings of 20th Annual Symposium on Logic in Computer Science. Chicago: IEEE Computer Society, 2005. 321–330

    Google Scholar 

  15. Lustig Y, Vardi M Y. Synthesis from component libraries. In: Alfaro L D, ed. Proceedings of 13th International Conference on Foundation of Software science and Computation Structures. New York: Springer, 2009. 395–409

    Google Scholar 

  16. Huai J P, Deng T, Li X X, et al. AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee. Sci China Ser F-Inf Sci, 2009, 52: 1534–1549

    Article  MATH  Google Scholar 

  17. Pistore M, Traverso P, Bertoli P, et al. Automated synthesis of composite bpel4WS web services. In: Chang C K, Zhang L J, eds. Proceeding of International Conference on Web Services. Växjő: IEEE Computer Society, 2005. 293–301

    Google Scholar 

  18. Wang J S, Li Z J, Li M J. Composing semantic web services with description logics. J Softw, 2008, 19: 967–980

    Article  Google Scholar 

  19. Qian Z Z, Lu S L, Xie L. Automatic composition of petri net based web services. Chinese J Comput, 2006, 29: 1057–1066

    Google Scholar 

  20. Pu K, Hristidis V, Koudas N. Syntactic rule based approach to Web service composition. In: Liu L, Reuter A, Whang K Y, et al., eds. Proceedings of International Conference on Data Engineering. Atlanta: IEEE Computer Society, 2006. 31–40

    Google Scholar 

  21. Boualem B F C, Toumani F. Representing, analysing and managing web service protocols. Data Knowl Eng, 2006, 58: 327–357

    Article  Google Scholar 

  22. Orna K, Moshe Y V, Pierre W. An automata-theoretic approach to branching-time model checking. J ACM, 2000, 47: 312–360

    Article  MathSciNet  MATH  Google Scholar 

  23. Moshe Y V. Alternating automata and program verification. Comput Sci Today, 1995, 1000: 471–485

    Article  Google Scholar 

  24. Muller D E, Schupp P E. Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra. Theor Comput Sci, 1995, 141: 69–107

    Article  MathSciNet  MATH  Google Scholar 

  25. Kupferman O, Moshe Y V. Module checking. In: Alur R, Henzinger T A, eds. Proceedings of International Conference on Computer Aided Verification. New Brunswick: Springer, 1996. 75–86

    Google Scholar 

  26. Kupferman O, Grumberg O. Buy one, get one free!!! J Logic Comput, 1996, 6: 523–539

    Article  MathSciNet  MATH  Google Scholar 

  27. Vardi M Y, Wolper P. Automata-theoretic techniques for modal logics of programs. J Comput Syst Sci, 1986, 32: 183–221

    Article  MathSciNet  MATH  Google Scholar 

  28. Fischer M J, Ladner R E. Propositional dynamic logic of regular programs. J Comput Syst Sci, 1979, 18: 194–211

    Article  MathSciNet  MATH  Google Scholar 

  29. Emerson E A. Temporal and modal logic. In: Handbook of Theoretical Computer Science, Vol B. Cambridge: MIT Press, 1990. 997–1072

    Google Scholar 

  30. Vardi M Y, Stockmeyer L. Improved upper and lower bounds for modal logics of programs. In: Sedgewick R, ed. Proceedings of Annual ACM Symposium on Theory of Computing. Providence: ACM, 1985. 240–251

    Google Scholar 

  31. Emerson E A, Sistla A P. Deciding braching time logic. In: DemMillo R, ed. Proceedings of ACM symposium on Theory of computing. Washington DC: ACM, 1984. 14–24

    Google Scholar 

  32. Emerson E A, Jutla C S. The complexity of tree automata and logics of programs. SIAM J Comput, 2000, 29: 132–158

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Software Development Environment, Beihang University, Beijing, 100191, China

    Ting Deng, JinPeng Huai & TianYu Wo

  2. School of Mathematics and System Science, Beihang University, Beijing, 100191, China

    Ting Deng

  3. School of Computer Science and Engineering, Beihang University, Beijing, 100191, China

    JinPeng Huai & TianYu Wo

Authors
  1. Ting Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. JinPeng Huai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. TianYu Wo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ting Deng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Deng, T., Huai, J. & Wo, T. Complexity of synthesis of composite service with correctness guarantee. Sci. China Inf. Sci. 55, 638–649 (2012). https://doi.org/10.1007/s11432-011-4460-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4460-z

Keywords

Search

Navigation