Checking Data-Flow Errors Based on The Guard-Driven Reachability Graph of WFD-Net

keywords: Petri net, workflow system, data-flow errors, reachability graph
In order to guarantee the correctness of workflow systems, it is necessary to check their data-flow errors, e.g., missing data, inconsistent data, lost data and redundant data. The traditional Petri-net-based methods are usually based on the reachability graph. However, these methods have two flaws, i.e., the state space explosion and pseudo states. In order to solve these problems, we use WFD-nets to model workflow systems, and propose an algorithm for checking data-flow errors based on the guard-driven reachability graph (GRG) of WFD-net. Furthermore, a case study and some experiments are given to show the effectiveness and advantage of our method.
mathematics subject classification 2000: 68-Q60
reference: Vol. 39, 2020, No. 1-2, pp. 193–212