• 论文 •    

时间约束工作流模型的可调度性分析算法

李慧芳,范玉顺   

  1. 清华大学自动化系,北京100084
  • 出版日期:2002-07-15 发布日期:2002-07-25

Schedulability Analysis Algorithm for Timing Constraint Workflow Models

LI Hui-fang,FAN Yu-shun   

  1. Dept. of Automation, Tsinghua Univ., Beijing100084,China
  • Online:2002-07-15 Published:2002-07-25

摘要: 针对目前工作流管理系统对时间管理支持的严重局限,提出了基于Petri网的工作流时间约束建模方法。首先,将工作流网扩展为时间约束工作流网,然后分析了工作流网的时间特性,并提出了时间约束工作流网的可调度性分析算法。研究结果表明,所提出的建模方法能全面描述工作流系统中的时间信息,对丰富工作流系统的时间约束建模理论具有重要的参考价值。

关键词: 工作流, 时间约束, Petri网, 可调度性分析

Abstract: For the important limitation of actual WorkFlow Management Systems(WFMS), a Petri nets-based workflow modeling method for time constraints is put forward. Firstly, we extend the workflow nets with time constraints and call the new nets Timing Constraint workflow nets (TCWF-nets), then after analyzing the timing property of WorkFlow nets (WF-nets), we proposed the schedulability analysis algorithm of TCWF-nets. The research results show that our method can roundly describe the time information and has the important reference value in enriching the theory of the time constraint modeling in WFMS.

Key words: workflow, time constraints, Petri nets, schedulability analysis

中图分类号: