Abstract
Companies use business process models to represent their working procedures in order to deploy services to markets, to analyze them, and to improve upon them. Competitive markets necessitate complex procedures, which lead to large process specifications with sophisticated structures. Real world process models can often incorporate hundreds of modeling constructs. While a large degree of detail complicates the comprehension of the processes, it is essential to many analysis tasks. This paper presents a technique to abstract, i.e., to simplify process models. Given a detailed model, we introduce abstraction rules which generalize process fragments in order to bring the model to a higher abstraction level. The approach is suited for the abstraction of large process specifications in order to aid model comprehension as well as decomposing problems of process model analysis. The work is based on process structure trees that have recently been introduced to the field of business process management.
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
OMG: Business Process Modeling Notation, Version 1.2 (January 2009)
Keller, G., Nüttgens, M., Scheer, A.: Semantische Prozessmodellierung auf der Grundlage “Ereignisgesteuerter Prozessketten (EPK)”. Technical Report 89, University of Saarland (1992)
Petri, C.: Kommunikation mit Automaten. PhD thesis, Institut für instrumentelle Mathematik, Bonn, Germany (1962)
Tarjan, R.E., Valdes, J.: Prime Subprogram Parsing of a Program. In: Proceedings of the 7th Symposium on Principles of Programming Languages (POPL), pp. 95–105. ACM, New York (1980)
Vanhatalo, J., Völzer, H., Koehler, J.: The Refined Process Structure Tree. In: Proceedings of the 6th International Conference on Business Process Management (BPM), Milan, Italy, September 2008, pp. 100–115 (2008)
Polyvyanyy, A., Smirnov, S., Weske, M.: Reducing Complexity of Large EPCs. In: Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten (MobIS: EPK), Saarbruecken, Germany (November 2008)
Polyvyanyy, A., Smirnov, S., Weske, M.: Process Model Abstraction: A Slider Approach. In: Proceedings of the 12th IEEE International Enterprise Distributed Object Computing Conference (EDOC), Munich, Germany (September 2008)
Berthelot, G.: Checking Properties of Nets using Transformation. In: Advances in Petri Nets 1985, London, UK, pp. 19–40. Springer, Heidelberg (1986)
Berthelot, G.: Transformations and Decompositions of Nets. In: Advances in Petri nets 1986, London, UK, pp. 359–376. Springer, Heidelberg (1987)
Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, New York (1995)
Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77(4), 541–580 (1989)
Weske, M.: Business Process Management: Concepts, Languages, Architectures. Springer, Heidelberg (2007)
Aalst, W.: Verification of Workflow Nets. In: Azéma, P., Balbo, G. (eds.) Application and Theory of Petri Nets, Berlin, Germany, pp. 407–426. Springer, Heidelberg (1997)
Battista, G.D., Tamassia, R.: Incremental Planarity Testing. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, FOCS (1989)
Battista, G.D., Tamassia, R.: On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica 15(4), 302–318 (1996)
Hopcroft, J.E., Tarjan, R.E.: Dividing a Graph into Triconnected Components. SIAM Journal on Computing 2(3), 135–158 (1973)
Fussell, D., Ramachandran, V., Thurimella, R.: Finding Triconnected Components by Local Replacement. SIAM Journal on Computing 22(3), 587–616 (1993)
Gutwenger, C., Mutzel, P.: A Linear Time Implementation of SPQR-Trees. In: Proceedings of the 8th International Symposium on Graph Drawing (GD), London, UK, pp. 77–90. Springer, Heidelberg (2001)
Liu, R., Kumar, A.: An Analysis and Taxonomy of Unstructured Workflows. In: van der Aalst, W.M.P., Benatallah, B., Casati, F., Curbera, F. (eds.) BPM 2005. LNCS, vol. 3649, pp. 268–284. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Polyvyanyy, A., Smirnov, S., Weske, M. (2009). The Triconnected Abstraction of Process Models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds) Business Process Management. BPM 2009. Lecture Notes in Computer Science, vol 5701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03848-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-03848-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03847-1
Online ISBN: 978-3-642-03848-8
eBook Packages: Computer ScienceComputer Science (R0)