一种工作流网的自动生成算法  

An Algorithm for Generating Workflow Nets

作　　者：谈芝梦 潘理 王希 李文彬 蒋军强 杨勃 TAN Zhimeng;PAN Li;WANG Xi;LI Wenbin;JIANG Junqiang;YANG Bo(School of Information Science and Engineering, Hunan Institute of Science and Technology, Yueyang 414006, China)

机构地区：[1]湖南理工学院信息科学与工程学院,湖南岳阳414006

出　　处：《湖南理工学院学报（自然科学版）》2019年第1期25-32,共8页Journal of Hunan Institute of Science and Technology(Natural Sciences)

基　　金：湖南省自然科学基金项目(2017JJ2016;2018JJ2152;2018JJ2153;2019JJ40105);湖南省科技计划项目(2016TP1021);湖南省教育厅科学研究项目(15A079;17A089)

摘　　要：针对工作流网人工建模容易出错、工作流分析方法缺乏大规模测试案例等问题,提出了一种自动构建工作流网的生成算法.该算法通过随机节点分组、全连接和最少连接、AND和OR类型转换等方式,自动生成具有自由选择性、安全性和无环性质的工作流网.算法最坏情况下的时间复杂度为O(mn/k),其中m为库所数,n为变迁数,k为库所分组数.同时,基于Matlab平台研制工作流网生成工具,可快速生成无环、自由选择和安全的工作流实例,为工作流分析方法提供了不同规模的测试数据.Aiming at the problems on constructing workflow nets by hand and lacking large-scale test cases for workflow analysis methods, this paper proposed an automatic algorithm for generating workflow nets. The algorithm produces free choice, safe and acyclic workflow nets by grouping of nodes, full connection and least connection, and type conversion between AND and OR node groups. The time complexity of the algorithm is O(mn/k) in the worst case, where m is the number of places, n is the number of transitions, and k is the number of place groups. Finally, a generation tool of workflow nets based on Matlab is developed. It can quickly generate different scales of workflow instances with the above properties, and provide abundant test data for the verification of workflow analysis methods.

关 键 词：工作流网 PETRI网 生成算法 自由选择性 安全性 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]