基于模块化可达图与研究服务组合验证及BPEL代码生成.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.21, No.8, August 2010, pp.1810− 1819 doi: 10.3724/SP.J.1001.2010.03618 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 基于模块化可达图的服务组合验证及 BPEL 代码生成 1+ 2 2 杜彦华 , 范玉顺 , 李喜彤 1(北京科技大学 机械工程学院,北京 100083) 2(清华大学 自动化系,北京 100084) Verifying Service Composition Based on Modular Reachability Graph and Generating BPEL Codes 1+ 2 2 DU Yan-Hua , FAN Yu-Shun , LI Xi-Tong 1(School of Mechanical Engineering, University of Science and Technology Beijing, Beijing 100083, China) 2(Department of Automation, Tsinghua University, Beijing 100084, China) + Corresponding author: E-mail: duyanhua@ Du YH, Fan YS, Li XT. Verifying service composition based on modular reachability graph and generating BPEL codes. Journal of Software, 2010,21(8):1810−1819. /1000-9825/3618.htm Abstract : To address state space explosion and the inability to automatically generate the BPEL (business process execution language) codes of the existing methods of composing services based on mediators, this paper presents an approach to verify the Petri net models of service composition by modular reachability graphs. In this approach, the Petri net models of service composition are divided into sub-models in a modular way, and verify the feasibility of composition by analyzing the state spaces of individual sub-models, without unfolding to the ordinary state space. Using this modular technique can avoid the state space explosion. After verification of the fe