This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Probability Timing Constraint WF-Nets and Their Application to Timing Schedulability Analysis of Workflow Management Systems
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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.
Citation:
Rui Han, Yingbo Liu, Lijie Wen, Jianmin Wang, "Probability Timing Constraint WF-Nets and Their Application to Timing Schedulability Analysis of Workflow Management Systems," csie, vol. 7, pp.669-673, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.