Parallel Degree of Well-Structured Workflow Nets
In this paper we discuss the parallel degree of well structured workflow nets WF nets for short First we give the definition of parallel degree PARAdeg for WF nets Second we show it is intractable to compute the value of PARAdeg for acyclic well structured WF nets Next we construct two heuristic algorithms to compute the value The first algorithm is focused on nest structure and the second one is focused on the longest path Finally we perform an experiment to compare the two algorithms and the result is that the accuracy of the first algorithm based on nest structure was higher than that of the second one based on the longest path for most well structured WF nets and the accuracy of the second one is better than that of first one only when the well structured workflow nets are mainly composed by the parallel structures
well structured wf nets paradeg heuristic algorithm nest structure longest path