The relationship between workflow graphs and free-choice workflow nets

Information Systems

Volumn 47, Issue , 2015, Pages 197-219

  Favre, Cédric ^a   Fahland, Dirk ^b   Völzer, Hagen ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Free choice; Inclusive Or join; Petri nets; Workflow graphs

Indexed keywords

FREE CHOICE; WORKFLOW GRAPH; WORKFLOW NETS;

PETRI NETS;

EID: 84908200638     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2013.12.004     Document Type: Article

References (30)

1. W. van der Aalst, Workflow verification: finding control-flow errors using Petri-net-based techniques, in: Business Process Management: Models, Techniques, and Empirical Studies, Lecture Notes in Computer Science, Springer-Verlag, vol. 1806, 2000, pp. 161-183.
2. W. van der Aalst, A. Hirnschall, H. Verbeek, An alternative way to analyze workflow graphs, in: CAiSE02, Lecture Notes in Computer Science, vol. 2348, 2002, pp. 535-552.
3. J. Esparza, Decidability and complexity of petri net problems - an introduction, in: W. Reisig, G. Rozenberg (Eds.), Petri Nets, Lecture Notes in Computer Science, vol. 1491, Springer, 1996, pp. 374-428.
4. J. Desel, and J. Esparza Free Choice Petri Nets 1995 Cambridge University Press New York, NY, USA
5. D. Fahland, C. Favre, J. Koehler, N. Lohmann, H. Völzer, and K. Wolf Analysis on demand instantaneous soundness checking of industrial business process models Data Knowl. Eng. 70 5 2011 448 466
6. R.J. van Glabbeek, The linear time-branching time spectrum (extended abstract), in: CONCUR, Lecture Notes in Computer Science, vol. 458, Springer, 1990, pp. 278-297.
7. W. van der Aalst, A. ter Hofstede, B. Kiepuszewski, and A. Barros Workflow patterns Distrib. Parallel Databases 14 1 2003 5 51
8. W.M.P. van der Aalst, A. Hirnschall, H.M.W.E. Verbeek, An alternative way to analyze workflow graphs, in: CAiSE 2002, Lecture Notes in Computer Science, vol. 2348, Springer, 2002, pp. 535-552.
9. T. Murata Petri nets properties, analysis and applications Proc. IEEE 77 4 1989 541 580
10. J. Dehnert, P. Rittgen, Relaxed soundness of business processes, in: K.R. Dittrich, A. Geppert, M.C. Norrie (Eds.), CAiSE, Lecture Notes in Computer Science, vol. 2068, Springer, 2001, pp. 157-170.
11. R.M. Dijkman, M. Dumas, and C. Ouyang Semantics and analysis of business process models in BPMN Inf. Softw. Technol. 50 12 2008 1281 1294
12. H. Störrle, J.H. Hausmann, Towards a formal semantics of UML 2.0 activities, in: P. Liggesmeyer, K. Pohl, M. Goedicke (Eds.), Software Engineering, Lecture Notes in Informatics, vol. 64, GI, 2005, pp. 117-128.
13. E. Kindler On the semantics of EPCs resolving the vicious circle Data Knowl. Eng. 56 1 2006 23 40
14. S.J. Leemans, D. Fahland, W.M. van der Aalst, Discovering block-structured process models from event logs - a constructive approach, in: S. Rinderle-Ma, F. Toumani, K. Wolf (Eds.), Petri Nets 2013, Lecture Notes in Computer Science, vol. 6896, Springer, 2013, pp. 148-165.
15. J. van der Werf, B. van Dongen, C. Hurkens, and A. Serebrenik Process discovery using integer linear programming Fundam. Inf. 94 2010 387 412
16. D. Fahland, W.M.P. van der Aalst, Repairing process models to reflect reality, in: BPM′12, Lecture Notes in Computer Science, vol. 7481, Springer, 2012, pp. 229-245.
17. J. Vanhatalo, H. Völzer, and F. Leymann Faster and more focused control-flow analysis for business process models through sese decomposition B.J. Krämer, K.-J. Lin, P. Narasimhan, ICSOC, Lecture Notes in Computer Science vol. 4749 2007 Springer 43 55
18. A. Polyvyanyy, J. Vanhatalo, and H. Völzer Simplified computation and generalization of the refined process structure tree M. Bravetti, T. Bultan, WS-FM, Lecture Notes in Computer Science vol. 6551 2010 Springer 25 41
19. H. Völzer, A New Semantics for the Inclusive Converging Gateway in Safe Processes, in: BPM, Lecture Notes in Computer Science, vol. 6336, Springer, 2010, pp. 294-309.
20. A. Alves, et al., Web Services Business Process Execution Language Version 2.0, OASIS Standard 11.
21. J. Vanhatalo, H. Völzer, F. Leymann, S. Moser, Automatic workflow graph refactoring and completion, in: ICSOC, Lecture Notes in Computer Science, vol. 5364, 2008, pp. 100-115.
22. M. Wynn, H. Verbeek, W. van der Aalst, A. ter Hofstede, and D. Edmond Business process verification - finally a reality! Bus. Process Manag. J. 15 1 2009 74 92
23. C. Favre, H. Völzer, Symbolic execution of acyclic workflow graphs, in: BPM, Lecture Notes in Computer Science, vol. 6336, Springer, 2010, pp. 260-275.
24. B. Kiepuszewski, A. ter Hofstede, and W. van der Aalst Fundamentals of control flow in workflows Acta Inf. 39 3 2003 143 209
25. T. Lengauer, and R. Tarjan A fast algorithm for finding dominators in a flowgraph ACM Trans. Program. Lang. Syst. 1 1 1979 121 141
26. J. Mendling, B. van Dongen, and W. van der Aalst Getting rid of OR-joins and multiple start events in business process models Enterp. Inf. Syst. 2 4 2008 403 419
27. J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev Deriving Petri nets for finite transition systems IEEE Trans. Comput. 47 8 1998 859 882
28. C. Stahl, A petri net semantics for BPEL, Technical Report, Humboldt-Universität zu Berlin, 2005.
29. N. Lohmann, A feature-complete Petri net semantics for WS-BPEL 2.0, in: WS-FM, Lecture Notes in Computer Science, vol. 4937, Springer-Verlag, 2008, pp. 77-91.
30. C. Ouyang, E. Verbeek, W. Van Der Aalst, S. Breutel, M. Dumas, and A. Ter Hofstede Formal semantics and analysis of control flow in WS-BPEL Sci. Comput. Program. 67 2 2007 162 198