%0 Journal Article
%T An Extended Deterministic Finite Automata Based Method for the Verification of Composite Web Services<br>一种基于扩展有限自动机验证组合Web服务的方法
%A EI Li-Hui
%A DUAN Zhen-Hua
%A <br>雷丽晖
%A 段振华
%J 软件学报
%D 2007
%I 
%X 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.
%K composite Web services
%K deterministic finite automata
%K formal verification<br>组合Web服务
%K 确定有限自动机
%K 形式化验证
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=2DBEC2FF7063C749809225A67717FFF9&yid=A732AF04DDA03BB3&vid=13553B2D12F347E8&iid=59906B3B2830C2C5&sid=822AE60AB8D52576&eid=29AE32B30980BD5E&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=20