In this paper, Timed Workflow Nets are introduced, and a characterization of the soundness property for them is provided. This characterization is based on boundedness and liveness as for classical workflow nets. It is shown that the properties of boundedness and liveness for timed Petri nets can be reduced in linear time to the same properties for untimed Petri nets. Therefore, the soundness property for timed workflow nets can be checked as efficiently as for workflow nets.
Citation:
Ferucio Laurenţiu Ţiplea, Geanina Ionela Macovei, "Timed Workflow Nets," synasc, pp.361-366, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005