On the regularity of Petri net languages
Information and Computation
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
Distributed and Parallel Databases
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
From Coloured Petri Nets to Object Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Moses - a tool suite for visual modeling of discrete-event systems
HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
Dynamic batch processing in workflows: Model and implementation
Future Generation Computer Systems
Qualitative analysis of workflow nets using linear logic: soundness verification
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Task scheduling modelling and reliability evaluation of grid services using coloured Petri nets
Future Generation Computer Systems
Hi-index | 0.00 |
Workflow net, based on Petri nets' characteristics, is powerful and used widely. However, the workflow net itself cannot guarantee the soundness for its defined models; and what is more, the coming analysis on the workflow net models are difficult. In this paper, based on the structure of the classical workflow net, it introduces a new kind of net for modeling business processes, named normalized workflow net (NWF-net). NWF-net, which can be represented by a context-free language, can effectively avoid those structure problems occurred in the classical workflow net by removing some possible unnatural patterns. NWF-net satisfies all the required properties needed for workflow process modeling while keeping a strongly modeling capability, and the computational performance analysis, such as the expected completion time, becomes simple.