Efficiency of reduction methods on the size and order of workflow net reachability graphs

The paper presents the effect of the reduction rules on the size of the resulting workflow net as well as the size and order of its reachability graph. The proposed method involves looking for the nodes and arcs in the reachability graph that is affected by the removal of places and transition of the Petri net. We determined that the reduction rules, with the exception of one rule, applied to the Petri net provides a reduction on the size and order of the its corresponding reachability graph.