Timing constraint workflow nets for workflow analysis

Jian Qiang Li, Yu Shun Fan, Meng Chu Zhou

Research output: Contribution to journalReview articlepeer-review

110 Scopus citations

Abstract

The analysis of the correctness and rationality of a workflow model plays an important role in the research of workflow techniques and successful implementation of workflow management. This paper points out the relevant problems in the verification and analysis of a workflow model. It discusses two important properties: schedulability and boundedness of a workflow model considering timing constraints. To specify the timing constraints, WorkFlow net is extended with time information, leading to timing constraint workflow net (TCWF-net). This paper presents a model mapping method to convert a directed network graph (DNG) based workflow model, which is built by a graphic process modeling language extended with time information, into a TCWF-net. It then discusses its schedulability verification and synthesis. An algorithm to decompose an acyclic and free-choice TCWF-net into a set of T-components is presented, followed by a boundedness verification method. The usefulness of the research results is illustrated by an example.

Original languageEnglish (US)
Pages (from-to)179-193
Number of pages15
JournalIEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.
Volume33
Issue number2
DOIs
StatePublished - Mar 2003

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Human-Computer Interaction
  • Computer Science Applications
  • Electrical and Electronic Engineering

Keywords

  • Business process automation
  • Petri nets
  • Schedulability
  • Workflow analysis
  • Workflow model

Fingerprint

Dive into the research topics of 'Timing constraint workflow nets for workflow analysis'. Together they form a unique fingerprint.

Cite this