Schedulability analysis algorithm for timing constraint workflow models

Hui Fang Li*, Yu Shun Fan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

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 time 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.

Original languageEnglish
Pages (from-to)527-532
Number of pages6
JournalJisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS
Volume8
Issue number7
Publication statusPublished - Jul 2002
Externally publishedYes

Keywords

  • Petri nets
  • Schedulability analysis
  • Time constraints
  • Workflow

Fingerprint

Dive into the research topics of 'Schedulability analysis algorithm for timing constraint workflow models'. Together they form a unique fingerprint.

Cite this