Polynomial analysis algorithms for free choice Probabilistic Workflow Nets

Finally, we present two extensions of our work. First, we show that our reduction rules can also be used to compute the expected reward parametrically, that is, as a function of parameters related to the probabilities and rewards of the transitions. Second, we discuss the extension of PWNs to workflow nets that are not confusion-free, and show that some of our results still hold.