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

Authors

  • Dongming Xiang School of Information Science and Technology, Zhejiang Sci-Tech University, 310018 Hangzhou, China
  • Guanjun Liu Department of Computer Science, Key Laboratory of Embedded System and Service Computing (MOE), Tongji University, 201804 Shanghai, China

DOI:

https://doi.org/10.31577/cai_2020_1-2_193

Keywords:

Petri net, workflow system, data-flow errors, reachability graph

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Published

2020-02-29

How to Cite

Xiang, D., & Liu, G. (2020). Checking Data-Flow Errors Based on The Guard-Driven Reachability Graph of WFD-Net. Computing and Informatics, 39(1-2), 193–212. https://doi.org/10.31577/cai_2020_1-2_193

Issue

Section

Special Section Articles