BPEL流程数据竞争和死锁检测算法研究  

Study of algorithm on data race and deadlock detection for BPEL process

作　　者：陈胜[1] 鲍亮[1] 陈平[1] 胡圣明[1] 王萌[1] 

机构地区：[1]西安电子科技大学软件工程研究所,陕西西安710071

出　　处：《西安电子科技大学学报》2008年第6期1056-1062,1068,共8页Journal of Xidian University

基　　金：国家"十一五"国家部委预研基金资助(513060601);研究生创新基金资助(05009)

摘　　要：针对BPEL(Business Process Execution Language)流程中出现的数据竞争和死锁问题,提出了一种基于图理论的检测方法.首先把BPEL流程转化为BPEL片段图,然后通过求BPEL片段图中强连通分量的方式判定流程是否存在死锁;通过求BPEL片段图中节点间的可达性以判定节点间的可并发性来检测流程中的数据竞争.该方法采用约束求解技术对BPEL中的变迁条件和联合表达式进行分析,提高了检测的准确性.实际应用结果表明,该方法可以检测出流程中的数据竞争和死锁,提高流程的可靠性.The business process always suffers from notorious problems, such as data race and deadlock. Moreover, these problems are extremely difficult to track down by testing and debugging. This paper proposes a novel detection approach for the BPEL process, which is based on the graph theory. The approach first transforms the BPEL process into a graphic model-BSG （BPEL Segment Graph）. Then, the deadlocks are detected by finding strongly connected components of BSG. Meanwhile, data races are detected by determining the partial order among nodes in BSG, which in turn can be attained by deciding the reachability among them. It also employs the technique of constraint solving to enhance the accuracy of the detection result. Data races and deadlocks can be effectively detected by this approach, as demonstrated by practical application, thus enhancing the reliability of BPEL processes.

关 键 词：业务流程执行语言 BPEL片段图 数据竞争检测 死锁检测 约束求解 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]