Timed Workflow Nets

Authors:
Ferucio Laurentiu Tiplea;Geanina Ionela Macovei
Affiliations:
University of Central Florida;Iaşi County Council
Venue:
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Year:
2005

Citing 0
Cited 2

Modelling and Analysis of Time-Constrained Flexible Workflows with Time Recursive ECATNets

Web Services and Formal Methods
Soundness for S- and A-timed workflow nets is undecidable

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.