By Topic

Probability Timing Constraint WF-Nets and Their Application to Timing Schedulability Analysis of Workflow Management Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Rui Han ; Tsinghua Univ., Beijing, China ; Yingbo Liu ; Lijie Wen ; Jianmin Wang

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.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:7 )

Date of Conference:

March 31 2009-April 2 2009