Abstract
Recently the study of workflow diagrams has received considerable attention in business process modelling. Formal methods such as Petri nets have been used to analyze and verify of logical properties. However, to our best knowledge, due to the complexity caused by the extreme flexible nature of workflow processes, little work has been done on the performance analysis for workflow diagrams except intensive simulations or approximation analysis based on Stochastic Petri net (SPN) or queueing theory. In this paper, timed workflow diagrams with both AND and OR logic will be modelled and analyzed as stochastic min-max systems. We will provide provable bounds on average tournaround time. The OR logic (known also as the Discriminator [1] ) requires that a downstream event happens whenever one of the upstream events happens. This is different from the AND logic modelling synchronization which requires that the output event happens when all input events happen.
This work was supported in part by NSFC Grant No. 60274011, Fundamental Research Funds from Tsinghua University, Chinese Scholarship Council and NCET program of China.
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
van der Aalst, W., ter Hofstede, A., Kiepuszewski, B., Barros, A.: Workflow patterns. Distributed and Parallel Databases 14, 5–51 (2003)
Lin, C., Qu, Y., Ren, F., Marinescu, D.C.: Performance equivalent analysis of workflow systems based on stochastic petri net models. In: Han, Y., Tai, S., Wikarski, D. (eds.) EDCIS 2002. LNCS, vol. 2480, pp. 1–64. Springer, Heidelberg (2002)
Li, J., Fan, Y., Zhou, M.: Performance modeling and analysis of workflow. IEEE Transactions on Systems, Man, And Cyberneticspart A: Systems and Humans 34, 229–242 (2004)
Zerguini, L.: On the estimation of the response time of the business process. In: 17th UK Performance Engineering Workshop, University of Leeds (2001)
Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.P.: Synchronization and Linearity. John Wiley and Sons, Chichester (1992)
Zhao, Q., Zheng, D.Z., Zhu, X.: Structure properties of min-max systems and existence of global cycle time. IEEE Trans. Automat. Contr. 46, 148–151 (2001)
Fristedt, B., Gray, L.: A Mordern Approach to Probability Theory. Birkhäuser, Boston (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, Q. (2005). Performance Bounds for a Class of Workflow Diagrams. In: Huang, DS., Zhang, XP., Huang, GB. (eds) Advances in Intelligent Computing. ICIC 2005. Lecture Notes in Computer Science, vol 3645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538356_65
Download citation
DOI: https://doi.org/10.1007/11538356_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28227-3
Online ISBN: 978-3-540-31907-8
eBook Packages: Computer ScienceComputer Science (R0)