基于逻辑工作流网的有限无死锁组合  

Finite deadlock-free combination based on logical workflow network

作　　者：陈金栋 刘伟 冯新 刘雷 CHEN Jindong;LIU Wei;FENG Xin;LIU Lei(College of Computer Science and Engineering,Shandong University of Science and Technology,Qingdao,Shandong 266590,China)

机构地区：[1]山东科技大学计算机科学与工程学院,山东青岛266590

出　　处：《山东科技大学学报（自然科学版）》2020年第5期89-97,共9页Journal of Shandong University of Science and Technology(Natural Science)

基　　金：山东科技大学研究生科技创新项目(SDKDYC190333)。

摘　　要：以逻辑工作流网作为描述过程模型的方法,提出了逻辑工作流网的有限组合,以状态转换图来描述工作流网的可达逻辑活动序列。根据死锁的充分条件,提出状态映射用以判断两个工作流网组合后出现的死锁。通过删除进入死锁的逻辑活动序列,提出标准伙伴状态转换图用以表述无死锁组合的活动序列。最后提出判断有限组合是否存在死锁的方法,并用一个简单的电子商务实例说明了方法的有效性。A logical workflow network is used as a method to describe the process model,and a limited combination of logical workflow networks is proposed.Then a state transition diagram is designed to describe the sequence of reachable logical activities of the workflow network.According to the sufficient conditions of a deadlock,a state map is introduced to judge the deadlock that occurs after the combination of two workflow networks.By deleting the logical activity sequence that enters the deadlock,a standard partner state transition diagram represents the activity sequence without deadlock combination.Finally,a method for judging the existence of deadlocks in finite combinations is proposed,and a simple e-commerce example is used to illustrate the effectiveness of the method.

关 键 词：PETRI网 逻辑工作流网 死锁 组合 多集 

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