Unveiling hidden unstructured regions in process models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5870 LNCS, Issue PART 1, 2009, Pages 340-356

  Polyvyanyy, Artem ^a   García Bañuelos, Luciano ^b   Weske, Mathias ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

^b UNIVERSITY OF TARTU   (Estonia)

Author keywords

Process model analysis; Process model correctness; Process model transformation; Process structure tree

Indexed keywords

BLOCK STRUCTURED; COMPLEX BEHAVIOR; CONTROL FLOWS; DIRECTED GRAPHS; EXECUTION SCENARIO; GATEWAY NODES; HIERARCHICAL PROCESS; IN-PROCESS; LINEAR TIME; MODEL ANALYSIS; NON-TRIVIAL; PROCESS EXECUTION; PROCESS MODEL; PROCESS STRUCTURES; STRUCTURAL CLASS; STRUCTURED PROCESS;

GATEWAYS (COMPUTER NETWORKS); INTERNET;

PROCESS CONTROL;

EID: 78049313970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05148-7_23     Document Type: Conference Paper

References (22)

1. Weske, M.: Business Process Management: Concepts, Languages, Architectures. Springer, Heidelberg (2007)
2. OMG: Business Process Modeling Notation, Version 1.2. (January 2009)
3. Laue, R., Mendling, J.: The Impact of Structuredness on Error Probability of Process Models. In: Kaschek, R., Kop, C., Steinberger, C., Fliedl, G. (eds.) UNISCON. LNBIP, vol. 5. Springer, Heidelberg (2008)
4. Kiepuszewski, B., ter Hofstede, A.H.M., Bussler, C.: On Structured Workflow Modelling. In: Wangler, B., Bergman, L.D. (eds.) CAiSE 2000. LNCS, vol. 1789, p. 431. Springer, Heidelberg (2000)
5. 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)
6. Aalst, W.: Verification of Workflow Nets. In: Azéma, P., Balbo, G. (eds.) Application and Theory of Petri Nets, pp. 407-426. Springer, Berlin (1997)
7. 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)
8. Vanhatalo, J., Völzer, H., Koehler, J.: The Refined Process Structure Tree. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 100-115. Springer, Heidelberg (2008)
9. Alves, A., Arkin, A., Askary, S., Barreto, C., Bloch, B., Curbera, F., Ford, M., Goland, Y., Guízar, A., Kartha, N., Liu, C.K., Khalaf, R., König, D., Marin, M., Mehta, V., Thatte, S., van der Rijn, D., Yendluri, P., Yiu, A.: Web Services Business Process Execution Language Version 2.0. OASIS Standard (April 2007)
10. Margolis, B.: SOA for the Business Developer: Concepts, BPEL, and SCA (Business Developers series). Mc Press (2007)
11. Oulsnam, G.: Unravelling Unstructured Programs. The Computer Journal 25(3), 379-387 (1982)
12. Lin, H., Zhao, Z., Li, H., Chen, Z.: A Novel Graph Reduction Algorithm to Identify Structural Conflicts. In: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS), Washington, DC, USA, vol. 9, p. 289. IEEE Computer Society, Los Alamitos (2002)
13. Hopcroft, J.E., Tarjan, R.E.: Dividing a Graph into Triconnected Components. SIAM Journal on Computing 2(3), 135-158 (1973)
14. Battista, G.D., Tamassia, R.: Incremental Planarity Testing. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, FOCS (1989)
15. Battista, G.D., Tamassia, R.: On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica 15(4), 302-318 (1996)
16. Fussell, D., Ramachandran, V., Thurimella, R.: Finding Triconnected Components by Local Replacement. SIAM Journal on Computing 22(3), 587-616 (1993)
17. Gutwenger, C., Mutzel, P.: A Linear Time Implementation of SPQR-Trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77-90. Springer, Heidelberg (2001)
18. Polyvyanyy, A., Smirnov, S., Weske, M.: The Triconnected Abstraction of Process Models. In: Proceedings of the 7th International Conference on Business Process Management (BPM), Ulm, Germany (September 2009)
19. Vanhatalo, J., Völzer, H., Leymann, F.: Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition. In: Krämer, B.J., Lin, K.-J., Narasimhan, P. (eds.) ICSOC 2007. LNCS, vol. 4749, pp. 43-55. Springer, Heidelberg (2007)
20. Petri, C.: Kommunikation mit Automaten. PhD thesis, Institut für instrumentelle Mathematik, Bonn, Germany (1962)
21. Aalst, W., Hirnschall, A., Verbeek, H.: An Alternative Way to Analyze Workflow Graphs. In: Pidduck, A.B., Mylopoulos, J., Woo, C.C., Ozsu, M.T. (eds.) CAiSE 2002. LNCS, vol. 2348, pp. 535-552. Springer, Heidelberg (2002)
22. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, New York (1995)