自由选择工作流网的可靠完备化简规则集  

Sound and Complete Set of Reduction Rules of Free Choice WF-Nets

作　　者：张曼[1] 段振华[1,2] 王小兵[1] 

机构地区：[1]西安电子科技大学计算理论与技术研究所,陕西西安710071 [2]西安电子科技大学ISN国家重点实验室,陕西西安710071

出　　处：《软件学报》2013年第5期993-1005,共13页Journal of Software

基　　金：国家重点基础研究发展计划(973)(2010CB328102);国家自然科学基金(61133001;61272117;61272118)

摘　　要：流程化简技术是一种重要的商业流程模型分析方法.已有的非形式化化简方法因缺乏理论基础而无法保证完备性.基于Petri网的化简方法应用范围不针对流程模型因而不能保证可靠性.提出了针对自由选择工作流网的一个可靠完备化简规则集,可靠性保证化简过程中这类模型的行为正确性被保持,完备性保证任意一个正确的此类工作流网最终都能被化简为最简形式.基于化简规则集给出可靠完备的合成规则集,用于流程模型的设计与精化.The reduction technique is an important analysis method for business process models. Existing informal reduction methods suffer from the infirm completeness because of their lack of formal fundamental. Also, Petri-net-based reduction methods available cannot guarantee the soundness due to their unspecific applications for process models. A sound and complete set of reduction rules is presented for free choice WF-nets. The soundness determines that the behavioral correctness of such a model is preserved during the reduction, and the completeness ensures that every such a correct WF-net can be finally reduced to its simplest form. Based on this, a sound and complete set of synthesis rules are given, which facilitates the design and refinement of process models.

关 键 词：自由选择工作流网 流程化简 合成 化简规则的可靠性 化简规则集的完备性 

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