一种基于扩展有限自动机验证组合Web服务的方法-软件学报.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.18, No.12, December 2007, pp.2980−2990 DOI: 10.1360/jos182980 Tel/Fax: +86-10 © 2007 by Journal of Software . All rights reserved. ∗ 一种基于扩展有限自动机验证组合 Web 服务的方法 + 雷丽晖 , 段振华 (西安电子科技大学 计算理论与技术研究所,陕西 西安 710071) An Extended Deterministic Finite Automata Based Method for the Verification of Composite Web Services + LEI Li-Hui , DUAN Zhen-Hua (Institute of Computing Theory and Technology, Xidian University, Xi’an 710071, China) + Corresponding author: Phn: +86-29 E-mail: leilihui@ Lei LH, Duan ZH. An extended deterministic finite automata based method for the verification of composite Web services. Journal of Software, 2007,18(12):2980−2990. /1000-9825/18/2980.htm 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