An Extended Deterministic Finite Automata Based Method for the Verification of Composite Web Services
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

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

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 10,2007
  • Revised:October 26,2007
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063