[1] Jiang Hao**, Dong Yisheng, Luo Junzhou,. An Effective Approach to Verify the Correctnessof Workflow Process Models Based on Petri Net* [J]. Journal of Southeast University (English Edition), 2002, 18 (4): 361-366. [doi:10.3969/j.issn.1003-7985.2002.04.015]

Copy

An Effective Approach to Verify the Correctnessof Workflow Process Models Based on Petri Net^*()

Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:

18

Issue:

2002 4

Page:

361-366

Research Field:

Computer Science and Engineering

Publishing date:

2002-12-30

Info

Title:

An Effective Approach to Verify the Correctnessof Workflow Process Models Based on Petri Net^*

Author(s):

Jiang Hao^**;  Dong Yisheng;  Luo Junzhou

Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China

Keywords:

workflow;  process modeling;  Petri net;  verification

PACS:

TP391

DOI:

10.3969/j.issn.1003-7985.2002.04.015

Abstract:

Along with the extensive use of workflow, analysis methods to verify the correctness of the workflow are becoming more and more important. In the paper, we exploit the verification method based on Petri net for workflow process models which deals with the verification of workflow and finds the potential errors in the process design. Additionally, an efficient verification algorithm is given.

References:

[1] van der Aalst W M P. Structural characterizations of sound workflow nets[R]. In: Eindhoven University of Technology, 1996.
[2] Onoda S, Ikkai Y, Kobayashi T, et al. Definition of deadlock patterns for business process workflow models[A]. In: Proc of the Thirty-Second Annual Hawaii Int Conf on System Sciences[C]. Maui, Hawaii, 1999.
[3] Straub P, Hurtado C A. Control in multi-threaded information systems[J]. Advances in Computers, 1996, (45): 1-50.
[4] ter Hofstede H M, Orlowska M E, Rajapakse J. Verification problems in conceptual workflow specifications[J].Data & Knowledge Engineering, 1998, 24(3):239-256.
[5] Pablo A, Straub, Carlos Hurtado L. Business process behaviour is(almost)free-choice[A]. In: CESE’96[C]. Lille, France, 1996.
[6] Yang Wenlun, Yao Shuzheng, Wu Yun. Software engineering[M]. Beijing: Publishing House of Electronics Industry, 1997.234-237.(in Chinese)
[7] Kemper Peter. Linear time algorithm to find a minimal deadlock in a strong connected free-choice net[A]. In: Application and Theory of Petri Nets[C]. Berlin: Springer-Verlag, 1992. 319-338.
[8] Kovalyov A, Mcleod R D. New rank theorems for Petri nets and their application to Workflow management[A].In: Proc IEEE Int Conf on System, Man and Cybernetics[C]. San Diego, USA, 1998. 226-231.
[9] Best E. Some classes of live and safe Petri nets, concurrency and nets[A]. In: Advances of Petri Nets[C].Berlin: Springer-Verlag, 1987. 71-94.

Memo

Memo:

* The project supported by the Science Foundation of SEU.
** Born in 1958, male, associate professor.

Common functions