标题：Effective algorithm for deciding S-coverability of workflow nets
作者：Lu, Fa-Ming ;Zeng, Qing-Tian ;Bao, Yun-Xia
作者机构：[Lu, Fa-Ming ;Zeng, Qing-Tian ] College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China;[ 更多
来源：Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS
摘要：To decide S-coverability of workflow net effectively, S-coverability decision was converted to linear programming problem. An effective algorithm was introduced to determine S-Coverability based on simplex method. Additionally, the simplex method was extended so that a set of minimal S-invariants supports could be generated with the proposed algorithm. When a given workflow net satisfied S-Coverability, the obtained set of minimal S-invariants supports would cover all the places. The proposed algorithm was verified in the circumstance of complaints handling business processes.