微信服务号

微信订阅号

2025年3月24日 17:57 星期一
首页 > 过刊浏览>2007年第18卷第12期 >2980-2990
PDF HTML阅读 XML下载 导出引用 引用提醒
一种基于扩展有限自动机验证组合Web服务的方法
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant Nos.60373103, 60433010 (国家自然科学基金); the Defence Pre-Research Project under Grant No.51315050105 (装备预先研究项目)


An Extended Deterministic Finite Automata Based Method for the Verification of Composite Web Services
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [18]
    • |
  • 相似文献
    • |
  • 引证文献
    • | |
  • 文章评论
    摘要:

    为简化并自动化组合Web服务验证,提出一种基于扩展有限自动机(extended deterministic finite automata,简称EDFA)验证组合Web服务的方法.使用EDFA可以准确地描述Web服务:EDFA的状态表达Web服务在与用户交互的过程中维护的状态;EDFA的状态转移及其标注描述Web服务与用户间的消息交换.EDFA给出Web服务交互过程的所有消息交换序列,刻画出Web服务的动态行为.使用基于EDFA的组合Web服务验证方法不但可以验证组合Web服务是否满足系统需求,还可以验证组合Web服务运行过程是否有逻辑错误.与其他方法相比,该方法更适于验证开放式环境下的组合Web服务.

    Abstract:

    To simplify and automate the verification of composite Web services,a method based on extended deterministic finite automata(EDFA) is presented.EDFA can describe Web services in an accurate way:the nodes represent states maintained by a service during the interactions between the service and its clients;the state transitions represent message exchanges between the service and its clients.Therefore,the automaton depicts the temporal sequences of messages,i.e.the behavior of the service.With the EDFA-based method for the verification of composite Web services,whether the capabilities of a service meet system requirements and whether there exist logic errors in the interactions between a service and its clients can be verified.Compared with other methods,this method is more suitable for the verification of composite Web services in an open environment.

    参考文献
    [1]Narayanan S,McIlraith SA.Simulation,verification and automated composition of Web services.In:Proc.of the 11th Int'l Conf.on World Wide Web.New York:ACM Press,2002.77-88.
    [2]Solanki M,Cau A,Zedan H.Augmenting semantic Web service description with compositional specification.In:Proc.of the 13th Int'l Conf.on World Wide Web.New York:ACM Press,2004.544-552.
    [3]Peltz C.Web services orchestration and choreography.IEEE Computer,2003,36(10):46-52.
    [4]Lei LH,Duan ZH.Automating Web service composition for collaborative business processes.In:Shen WM,ed.Proc.of the 12th Int'l Conf.on CSCWD.Melbourne:IEEE Press,2007.108-116.
    [5]Koshkina M,van Breugel F.Modeling and verifying Web service orchestration by means of the concurrency workbench.ACM SIGSOFT Software Engine Notes,2004,29(5):1-10.
    [6]Qian ZZ,Lu SL,Xie L.Automatic composition of Petri net based Web services.Chinese Journal of Computers,2006,29(7):1057-1066 (in Chinese with English abstract).
    [7]Hou LS,Jin Z,Wu BD.Modeling and verifying Web services driven by requirements:An ontology based approach.Science in China (Series E),2006,36(10):1189-1219 (in Chinese with English abstract).
    [8]Fu X,Bultan T,Su JW.Analysis of interacting BPEL Web services.In:Proc.of the13th Int'l Conf.on World Wide Web.New York:ACM Press,2004.621-630.
    [9]Fu X,Bultan T,Su JW.WSAT:A tool for formal analysis of Web services.In:Alur R,Peled D,eds.Proc.of the 16th Int'l Conf.on Computer Aided Verification.2004.510-514.
    [10]Fu X,Bultan T,Su JW.Synchronizability of conversations among Web services.IEEE Trans.on Software Engineering,2005,31(12):1042-1055.
    [11]Wombacher A,Fankhauser P,Mahleko B,Neuhold E.Matchmaking for business processes based on choreographies.Int'l Journal of Web Services Research,2004,1(4):14-32.
    [12]Hopcroft JE,Motwani R,Ullman JD.Introduction to Automata Theory,Languages,and Computation.2nd ed.,New York:Addison Wesley,2001.
    [13]Papazoglou M,Georgakopoulos D.Service-Oriented computing:Introduction.Communications of the ACM,2003:25-28.
    [14]Paolucci M,Kawamura T,Payne TR,Sycara K.Semantic matching of Web services capabilities.In:Proc.of the ISWC 2002.LNCS 2342,2002.333-347.
    [15]Lei LH,Duan ZH.Transforming OWL-S process model into EDFA for service discovery.In:Proc.of the ICWS 2006.Chicago:IEEE Press,2006.108-116.
    [16]Tian C,Duan ZH.Model checking propositional projection temporal logic based on SPIN.In:Proc.of the 9th international Annual Conf.on Formal Enginnering Method.LNCS 4789,2007.246-265.
    [6]钱柱中,陆桑璐,谢立.基于Petri网的Web服务自动组合研究.计算机学报,2006,29(7):1057-1066.
    [7]侯丽珊,金芝,吴步丹.需求驱动的Web服务建模及其验证:一个基于本体的方法.中国科学E辑,2006,36(10):1189-1219. [1]作为服务请求者,如果消息交换为one-way模式,则Web服务发送调用请求,接收的调用结果值为空;如果消息交换为notification模式,则Web服务接收调用请求,返回的调用结果值为空. [1]验证Web服务功能时的状态转移标注置换与验证Web服务运行过程时的状态转移标注置换有所不同.因为,在验证Web服务功能时,只需得到Web服务与用户之间所有可能的消息交换事件的时序关系,无须考虑消息交换是由谁发起的.
    相似文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

雷丽晖,段振华.一种基于扩展有限自动机验证组合Web服务的方法.软件学报,2007,18(12):2980-2990

复制
分享
文章指标
  • 点击次数:7932
  • 下载次数: 8660
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2007-06-10
  • 最后修改日期:2007-10-26
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19728452位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号