Abstract
Time management in workflow systems is crucial in determining and controlling the life cycle of a workflow process. Research on time modeling and analysis is important to guarantee workflow plans to be efficiently implemented and to make enterprises more competitive. Time WF-nets derived from time Petri nets and WF-nets are an effective model for workflow time management. In this paper, considering multiple instances of one workflow model run concurrently, we concern how to determine the workflow instance arrival cycle in order to make the waiting time of each instance as short as possible. Meanwhile the safety property of Time WF-nets is preserved. The key contribution of our work is twofold. First, instance arrival cycle is calculated in order to satisfy the safety property of Time WF-nets. Second, performance evaluation for Time WF-nets is proposed, which is based on instance arrival cycle and instance throughput cycle derived from safety analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sadiq, W., Orlowska, M.E.: Analyzing Process Models using Graph Reduction Techniques. Information systems 25(2), 117–134 (2000)
van der Aalst, W.M.P.: The Application of Petri nets to Workflow Management. The Journal of Circuits, Systems and Computers (1998)
Bastos, R.M., Ruiz, D.D.A.: Extending UML Activity Diagram for Workflow Modeling in Production Systems. In: Proceedings of the 35th Hawaii International Conference on System Sciences (2000)
Bajaj, A., Ram, S.: SEAM: A State-Entity-Activity-Model for a Well-Defined Workflow Development Methodology. IEEE Transactions on Knowledge and Data. Engineering 14(2), 415–431 (2002)
Li, J.Q., Fan, Y.S., Zhou, M.C.: Performance Modeling and Analysis of Workflow. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans 34(2), 229–242 (2004)
Li, J.Q., Fan, Y.S., Zhou, M.C.: Timing Constraint Workflow Nets for Workflow Analysis. IEEE Transactions on Systems, Man, and Cybernetics-Part A: System and Humans 33(2), 179–193 (2003)
Ling, S., Schmidt, H.: Time Petri nets for Workflow Modeling and Analysis. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (2000)
Bowden, F.D.J.: Survey and Synthesis of the Roles of Time in Petri Nets. Mathematical and Computer Modeling, 31, 55–68 (2000)
Kotb, Y.T., Baumgart, A.S.: An Extended Petri net for Modeling Workflow with Critical Sections. In: Proceedings of the 2005 IEEE International Conference on e-Business Engineering (2005)
Berthomieu, B., Diaz, M.: Modeling and Verification of Time Dependent Systems using Time Petri Nets. IEEE Transactions on Software Engineering 17(3), 259–273 (1991)
Boyer, M., Diaz, M.: Multiple Enabledness of Transition in Petri Nets with Time. In: Proceedings of the 9th International Workshop on Petri Nets and Performance Models (2001)
Tsai, J.J.P., Yang, S.J., Chang, Y.H.: Timing Constraint Petri Nets and Their Applications to Schedulability Analysis of Real-Time System Specifications. IEEE Transactions on Software Engineering 21(1), 32–49 (1995)
Wang, J.C., Deng, Y., Zhou, M.C.: Compositional Time Petri Nets and Reduction Rules. IEEE Transactions on Systems, Man, and Cybernetics-Part. A: Cybernetics 30(4), 562–572 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, W., Dou, W., Chen, J., Fan, S. (2007). Safety Analysis and Performance Evaluation of Time WF-nets. In: Chang, K.CC., et al. Advances in Web and Network Technologies, and Information Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72909-9_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-72909-9_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72908-2
Online ISBN: 978-3-540-72909-9
eBook Packages: Computer ScienceComputer Science (R0)