Timing constraint workflow nets for workflow analysis

Document Type

Article

Publication Date

3-1-2003

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.

Identifier

0041877653 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Part A Systems and Humans

External Full Text Location

https://doi.org/10.1109/TSMCA.2003.811771

ISSN

10834427

First Page

179

Last Page

193

Issue

2

Volume

33

Grant

60274046

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS