Probability Timing Constraint WF-Nets and Their Application to Timing Schedulability Analysis of Workflow Management Systems
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.196
For obtaining timely responses in workflow management systems, we must design a schedule of task executions in a timely manner with respect to imposed timing constraints. We call the procedure of verifying that a schedule satisfies the timing constraints as timing schedulability analysis. Traditional work proposed for schedulability analysis only give definite analysis results of timing constraints satisfaction or violation, which are too rigorous in practice. In this paper, we define Probability Timing Constraint WF-nets (PTCWF-nets) and their corresponding timing schedulability analysis approach, which extends the analysis result into probability of satisfaction. By means of this analysis result, process designer can flexibly evaluate timing constraints and proactively take suitable measures to deal with possible timing constraint violations.
Y. Liu, L. Wen, R. Han and J. Wang, "Probability Timing Constraint WF-Nets and Their Application to Timing Schedulability Analysis of Workflow Management Systems," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 669-673.