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

针对BPEL(Business Process Execution Language)流程中出现的数据竞争和死锁问题，提出了一种基于图理论的检测方法．首先把BPEL流程转化为BPEL片段图，然后通过求BPEL片段图中强连通分量的方式判定流程是否存在死锁; 通过求BPEL片段图中节点间的可达性以判定节点间的可并发性来检测流程中的数据竞争．该方法采用约束求解技术对BPEL中的变迁条件和联合表达式进行分析，提高了检测的准确性．实际应用结果表明，该方法可以检测出流程中的数据竞争和死锁，提高流程的可靠性．

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

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 partia...