On Reachability in Acyclic Well-Structured Workflow Nets

Abstract

Workflow net is a particular class of Petri net for verifying the correctness of workflows. Reach ability problem for workflow nets plays an important role in the verification, but the problem is known to be intractable. Limiting our analysis to a subclass of workflow net, called a cyclic well-structured workflow net, we gave a necessary and sufficient condition on the reach ability problem. Based on this condition, we also constructed a polynomial time procedure for solving the problem.