DocumentCode
2200936
Title
New rank theorems for Petri nets and their application to workflow management
Author
Kovalyov, Andrei ; McLeod, Robert D.
Author_Institution
Dept. of Electr. & Comput. Eng., Manitoba Univ., Winnipeg, Man., Canada
Volume
1
fYear
1998
fDate
11-14 Oct 1998
Firstpage
226
Abstract
New Rank Theorems for Petri nets are given. These theorems are stronger than the known ones in the sense that the new necessary and sufficient conditions of well-formedness are weaker than the known ones. We show how these theorems can be used in the analysis of workflow procedures.
Keywords
Petri nets; production control; Petri nets; rank theorems; well-formedness; workflow management; workflow procedures; Application software; Engineering management; Petri nets; Polynomials; Sufficient conditions; System recovery; Yttrium;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on
ISSN
1062-922X
Print_ISBN
0-7803-4778-1
Type
conf
DOI
10.1109/ICSMC.1998.725413
Filename
725413
Link To Document