Title :
On Reachability in Acyclic Well-Structured Workflow Nets
Author :
Yamaguchi, Satarou
Author_Institution :
Grad. Sch. of Sci. & Eng., Yamaguchi Univ., Ube, Japan
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.
Keywords :
Petri nets; computational complexity; information systems; reachability analysis; workflow management software; Petri net; acyclic well-structured workflow nets; information systems; polynomial time procedure; reachability problem; workflow management systems; Law; Mathematical model; Petri nets; Polynomials; Vectors; Petri net; polynomial-time; reachability; well-structured; workflow net;
Conference_Titel :
Networking and Computing (ICNC), 2012 Third International Conference on
Conference_Location :
Okinawa
Print_ISBN :
978-1-4673-4624-5
DOI :
10.1109/ICNC.2012.83
