Maximal structuring of acyclic process models

Computer Journal

Volumn 57, Issue 1, 2014, Pages 12-35

  Polyvyanyy, Artem ^a   García Bañuelos, Luciano ^b   Fahland, Dirk ^c   Weske, Mathias ^d  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b UNIVERSITY OF TARTU   (Estonia)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d UNIVERSITY OF POTSDAM   (Germany)

Author keywords

fully concurrent bisimulation; maximal structuring; model transformation; process modeling; structured process model

Indexed keywords

BISIMULATIONS; MAXIMAL STRUCTURING; MODEL TRANSFORMATION; PROCESS MODELING; STRUCTURED PROCESS MODELS;

COMPUTERS;

COMPUTER SCIENCE;

EID: 84891523399     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxs126     Document Type: Article

References (69)

1. Weske, M. (2012) Business Process Management: Concepts, Languages, Architectures (2nd edn). Springer, Berlin.
2. van der Aalst, W.M.P. and Stahl, C. (2011) Modeling Business Processes: A Petri Net-Oriented Approach. The MIT Press, Cambridge, MA.
3. Dumas, M., van der Aalst, W.M.P. and ter Hofstede, A.H.M. (2005) Process-Aware Information Systems: Bridging People and Software through Process Technology. Wiley-Interscience, Hoboken, NJ.
4. Kiepuszewski, B., ter Hofstede, A.H.M. and Bussler, C. (2000) On Structured Workflow Modelling. Proc. CAiSE 2000, Stockholm, Sweden, June 5-9, Lecture Notes in Computer Science 1789, pp. 431-445. Springer, Berlin.
5. Liu, R. and Kumar, A. (2005) An Analysis and Taxonomy of Unstructured Workflows. Proc. BPM 2005, Nancy, France, September 5-8, Lecture Notes in Computer Science 3649, pp. 268-284. Springer, Berlin. (Pubitemid 41490768)
6. Polyvyanyy, A., García-Bañuelos, L. and Dumas, M. (2012) Structuring acyclic process models. Inf. Syst., 37, 518-538.
7. BPMN2.0 (2011) Business Process Model and Notation (BPMN) Version 2.0. Object Management Group. Needham, MA.
8. Keller, G., Nüttgens, M. and Scheer, A.-W. (1992) Semantische Prozeßmodellierung auf der Grundlage 'Ereignisgesteuerter Prozeßketten (EPK). Technical Report Heft 89. Voröffentlichungen des Instituts fürWirtschaftsinformatik (IWi), Universität des Saarlandes, Saarbrüken, Germany.
9. Kitzmann, I.,König, C., Lübke, D. and Singer,L. (2009)ASimple Algorithm for Automatic Layout of BPMN Processes. Proc. CEC 2009,Vienna, Austria, July 20-23, pp. 391-398. IEEE Computer Society, Los Alamitos, CA.
10. Effinger, P., Siebenhaller, M. and Kaufmann, M. (2009) An Interactive Layout Tool for BPMN. Proc. CEC 2009, Vienna, Austria, July 20-23, pp. 399-406. IEEE Computer Society, Los Alamitos, CA.
11. Laue, R. and Mendling, J. (2008) The Impact of Structuredness on Error Probability of Process Models. Proc. UNISCON 2008, Klagenfurt, Austria, April 22-25, Lecture Notes in Business Information Processing 5, pp. 585-590. Springer, Berlin.
12. Laguna, M. and Marklund, J. (2005) Business Process Modeling, Simulation, and Design. Prentice Hall.
13. Yang, Y., Dumas, M., García-Bañuelos, L., Polyvyanyy, A. and Zhang, L. (2012) Generalized aggregate Quality of Service computation for composite services. J. Syst. Softw., 85, 1818- 1830.
14. Schuller, D., Polyvyanyy, A., García-Bañuelos, L. and Schulte, S. (2011) Optimization of Complex QoS-Aware Service Compositions. Proc. ICSOC 2011, Paphos, Cyprus, December 5-8, Lecture Notes in Computer Science 7084, pp. 452-466. Springer, Berlin.
15. Ouyang, C., Dumas, M., ter Hofstede, A.H.M. and van der Aalst, W.M.P. (2006) From BPMN Process Models to BPEL Web Services. Proc. ICWS 2006, Chicago, IL, September 18- 22, pp. 285-292. IEEE Computer Society, Los Alamitos, CA. (Pubitemid 351209864)
16. Weidlich, M., Decker, G., Großkopf, A. and Weske, M. (2008) BPEL to BPMN: The Myth of a Straight-Forward Mapping. Proc. OTM Conf. 2008, Monterrey, Mexico, November 9-14, Lecture Notes in Computer Science 5331, pp. 265-282. Springer, Berlin.
17. Mazanek, S. and Hanus, M. (2011) Constructing a bidirectional transformation betweenBPMNand BPEL with a functional logic programming language. J. Vis. Lang. Comput., 22, 66-89.
18. Weber, B., Reichert, M., Mendling, J. and Reijers, H.A. (2011) Refactoring large process model repositories. Comput. Ind., 62, 467-486.
19. Dijkman, R.M., Gfeller, B., Küster, J.M. and Völzer, H. (2011) Identifying refactoring opportunities in process model repositories. Inf. Softw. Technol., 53, 937-948.
20. Uba, R., Dumas, M., García-Bañuelos, L. and Rosa, M.L. (2011) Clone Detection in Repositories of Business Process Models. Proc. BPM 2011, Clermont-Ferrand, France, August 30-September 2, Lecture Notes in Computer Science 6896, pp. 248-264. Springer, Berlin.
21. Ferrante, J., Ottenstein, K.J. andWarren, J.D. (1987) The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst., 9, 319-349. (Pubitemid 17641083)
22. BPEL 2.0 (2007) Web Services Business Process Execution Language Version 2.0. OASIS WS-BPEL TC. Boston, MA.
23. Reichert, M. and Dadam, P. (1998) ADEPTflex - supporting dynamic changes of workflows without losing control. J. Intell. Inf. Syst., 10, 93-129.
24. Rinderle, S., Reichert, M. and Dadam, P. (2004) Flexible support of team processes by adaptive work flows ystems. Distrib.Parallel Databases, 16, 91-116.
25. van der Aalst,W.M.P., van Dongen, B.F., Herbst, J., Maruster, L., Schimm, G. andWeijters, A.J.M.M. (2003)Workflow mining: A survey of issues and approaches. Data Knowl. Eng., 47, 237-267.
26. Best, E., Devillers, R.R., Kiehn, A. and Pomello, L. (1991) Concurrent bisimulations in Petri nets. Acta Inform., 28, 231-264.
27. van Glabbeek, R.J. and Goltz, U. (1989) Equivalence Notions for Concurrent Systems and Refinement of Actions (extended abstract). Proc. MFCS 1989, Porabka-Kozubnik, Poland, August 28-September 1, Lecture Notes in Computer Science 379, pp. 237-248. Springer, Berlin.
28. Rabinovich, A. and Trakhtenbrot, B.A. (1988) Behavior structures and nets. Fundam. Inform., 11, 357-404.
29. Tarasyuk, I.V. (1997) Equivalence notions for models of concurrent and distributed systems. PhD Thesis, A.P. Ershov Institute of Informatics Systems, Siberian Division of the Russian Academy of Sciences. Novosibirsk, Russia.
30. Sassone, V., Nielsen, M. and Winskel, G. (1996) Models for concurrency: Towards a classification. Theor. Comput. Sci., 170, 297-348. (Pubitemid 126411637)
31. Tarasyuk, I.V. (1996) Equivalence notions for design of concurrent systems using Petri nets. Hildesheimer Informatik- Bericht 4/96, part 1, 19p. Institut für Informatik, Universität Hildesheim, Hildesheim, Germany.
32. Elliger, F., Polyvyanyy, A. andWeske, M. (2010) On Separation of Concurrency and Conflicts in Acyclic Process Models. Proc. EMISA 2010, Karlsruhe, Germany, October 7-8, Lecture Notes in Informatics 172, pp. 25-36. Gesellschaft für Informatik (GI), Bonn, Germany.
33. Dijkstra, E.W. (1968) Letters to the editor: Go To statement considered harmful. Commun. ACM, 11, 147-148.
34. Hopkins, M.E. (1972) A Case for the GOTO. Proc. 25th ACM Annual Conf., pp. 787-790. ACM Press, NewYork, NY.
35. Wulf, W.A. (1972) A Case Against the GOTO. Proc. 25th ACM Annual Conf., pp. 791-797. ACM Press, NewYork, NY.
36. Rubin, F. (1987) 'GOTO considered harmful' considered harmful. Commun. ACM, 30, 195-196.
37. Moore, D., Musciano, C., Liebhaber, M.J., Lott, S.F. and Starr, L. (1987) "'GOTO considered harmful" considered harmful' considered harmful. Commun. ACM, 30, 351-355.
38. Williams, M.H. (1977) Generating structured flow diagrams: The nature of unstructuredness. Comput. J., 20, 45-50.
39. Williams, M.H. and Ossher, H.L. (1978) Conversion of unstructured flow diagrams to structured form. Comput. J., 21, 161-167. (Pubitemid 8623233)
40. Oulsnam, G. (1982) Unravelling unstructured programs. Comput. J., 25, 379-387.
41. Zhang, F. and D'Hollander, E.H. (2004) Using hammock graphs to structure programs. IEEE Trans. Softw. Eng., 30, 231-245.
42. Hauser, R. and Koehler, J. (2004) Compiling Process Graphs into Executable Code. Proc. GPCE 2004, Vancouver, Canada, October 24-28, Lecture Notes in Computer Science 3286, pp. 317-336. Springer, Berlin. (Pubitemid 39745362)
43. Koehler, J. and Hauser,R. (2004) Untangling Unstructured Cyclic Flows - A Solution Based on Continuations. Proc. OTM Conf. 2004, Agia Napa, Cyprus, October 25-29, Lecture Notes in Computer Science 3290, pp. 121-138. Springer, Berlin. (Pubitemid 39750431)
44. Lohmann, N. and Kleine, J. (2008) Fully-Automatic Translation of Open Workflow Net Models into Simple Abstract BPEL Processes. Proc. Modellierung 2008, Berlin, Germany, March 12-14, Lecture Notes in Informatics 127, pp. 57-72. Gesellschaft für Informatik (GI), Bonn, Germany.
45. Hauser, R., Friess, M., Küster, J.M. and Vanhatalo, J. (2008) An incremental approach to the analysis and transformation of workflows using region trees. IEEE Trans. Syst. Man Cybern. Part C, 38, 347-359. (Pubitemid 351663120)
46. Polyvyanyy, A., García-Bañuelos, L. and Weske, M. (2009) Unveiling Hidden Unstructured Regions in Process Models. Proc. OTM Conf. 2009, Vilamoura, Portugal, November 1-6, LNCS 5870, pp. 340-356. Springer, Berlin.
47. Böhm, C. and Jacopini, G. (1966) Flow diagrams, Turing machines and languages with only two formation rules. Communications of the ACM, 9, 366-371.
48. Best, E. and Shields, M.W. (1983) Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets. Proceedings of CAAP'83, L'Aquila, Italy, March 9-11, LNCS 159, pp. 141-154. Springer, Berlin.
49. Best, E. (1987) Structure Theory of Petri Nets: The Free Choice Hiatus. Advances in Petri Nets 1986, Part I, Proceedings of an Advanced Course, Bad Honnef,West Germany, September 8-19, Lecture Notes in Computer Science 254, pp. 168-205. Springer, Berlin.
50. Kiepuszewski, B., ter Hofstede,A.H.M. and van derAalst,W.M.P. (2003) Fundamentals of control flow in workflows. Acta Inform., 39, 143-209. (Pubitemid 36467936)
51. van der Aalst, W.M.P. (2000) Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques. In van der Aalst,W.M.P., Desel, J. and Oberweis, A. (eds), Business Process Management, Models, Techniques, and Empirical Studies, Lecture Notes in Computer Science 1806, pp. 161-183. Springer, Berlin.
52. van derAalst,W.M.P. (1997)Verification of Work flow Nets. Proc. ICATPN'97, Toulouse, France, June 23-27, Lecture Notes in Computer Science 1248, pp. 407-426. Springer, Berlin.
53. Engelfriet, J. (1991) Branching processes of Petri nets. Acta Inform., 28, 575-591. (Pubitemid 21693790)
54. Esparza, J. and Heljanko, K. (2008) Unfoldings - A Partial-Order Approach to Model Checking. Springer, Berlin.
55. McMillan, K.L. (1995) A technique of state space search based on unfolding. Form. Methods Syst. Des., 6, 45-65.
56. Nielsen, M., Plotkin, G.D. and Winskel, G. (1981) Petri nets, event structures and domains, Part I. Theor. Comput. Sci., 13, 85-108.
57. Esparza, J., Römer, S. andVogler,W. (2002) An improvement of McMillan's unfolding algorithm. Form. Methods Syst. Des., 20, 285-310. (Pubitemid 34448852)
58. Polyvyanyy, A., Vanhatalo, J. and Völzer, H. (2010) Simplified Computation and Generalization of the Refined Process Structure Tree. Proc. WS-FM 2010, Hoboken, NJ, September 16-17, Lecture Notes in Computer Science 6551, pp. 25-41. Springer, Berlin.
59. Vanhatalo, J., Völzer, H. and Koehler, J. (2009) The refined process structure tree. Data Knowl. Eng., 68, 793-818.
60. van Hee, K.M., Sidorova, N. and Voorhoeve, M. (2003) Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach. Proc. ICATPN 2003, Eindhoven, The Netherlands, June 23-27, Lecture Notes in Computer Science 2679, pp. 337-356. Springer, Berlin.
61. McConnell, R.M. and de Montgolfier, F. (2005) Linear-time modular decomposition of directed graphs. Discrete Appl. Math., 145, 198-209.
62. Fahland, D. (2010) From Scenarios To Components. PhD Thesis, Humboldt-Universität zu Berlin and Technische Universiteit Eindhoven.
63. Fahland, D., Favre, C., Koehler, J., Lohmann, N., Völzer, H. and Wolf, K. (2011) Analysis on demand: Instantaneous soundness checking of industrial business process models. Data Knowl. Eng., 70, 448-466.
64. Verbeek, H.M.W.E. and van der Aalst, W.M.P. (2000) Woflan 2.0:A Petri-Net-Based Work flow Diagnosis Tool. Proc. ICATPN 2000, Aarhus, Denmark, June 26-30, Lecture Notes in Computer Science 1825, pp. 475-484. Springer, Berlin.
65. Verbeek, H.M.W.E., Basten, T. and van der Aalst,W.M.P. (2001) Diagnosing workflow processes using woflan. Comput. J., 44, 246-279. (Pubitemid 34011460)
66. Polyvyanyy, A.,Weidlich, M. andWeske, M. (2011) Connectivity of workflow nets: The foundations of stepwise verification. Acta Inform., 48, 213-242.
67. Cortadella, J., Kishinevsky, M., Lavagno, L. and Yakovlev, A. (1998) Deriving Petri nets for finite transition systems. IEEE Trans. Comput., 47, 859-882. (Pubitemid 128738520)
68. Bergenthum, R., Desel, J. and Mauser, S. (2009) Comparison of different algorithms to synthesize a Petri net from a partial language. Trans. Petri Nets Other Models Concurr., 3, 216-243.
69. Armas-Cervantes, A., García-Bañuelos, L. and Dumas, M. (2012) Event Structures as a Foundation for Process Model Differencing, Part 1: Acyclic Processes. Proc. WS-FM 2012, Tallinn, Estonia, September 6-7. Springer, Berlin (to appear).