期刊文献+

AutoSyn:A new approach to automated synthesis of composite web services with correctness guarantee 被引量:3

AutoSyn:A new approach to automated synthesis of composite web services with correctness guarantee
原文传递
导出
摘要 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. 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.
出处 《Science in China(Series F)》 2009年第9期1534-1549,共16页 中国科学(F辑英文版)
基金 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) the Program for New Century Excellent Talents in University (Grant No. NCET-05-0186)
关键词 business protocol SYNTHESIS composite service correctness constraints L* algorithm business protocol, synthesis, composite service, correctness constraints, L* algorithm
  • 相关文献

参考文献25

  • 1Hull R, Su J. Tools for composite web services: a short overview. SIGMOD Rec, 2005, 34(2): 86-95.
  • 2Berardi 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.
  • 3Fu 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.
  • 4Probert R L, Saleh K. Synthesis of communication protocols: Survey and assessment. IEEE Trans Comput, 1991, 40(4): 468-476.
  • 5Magee 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.
  • 6Rintanen J. Computational complexity of plan and controller synthesis under partial observability. Technical Report, 2005. http://users.rsise.anu.edu.au/j ussi/Rint anen05compl, pdf.
  • 7Pistore 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.
  • 8Rivest R L, Schapire R E. Inference of finite automata using homing sequences. Inf Comput, 1993, 103(2): 299-347.
  • 9Clarke E M, Grumberg O, Peled D A. Model Checking. Cambridge, MA: MIT Press, 2000.
  • 10Manolios 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.

同被引文献2

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部