Connectivity of workflow nets: The foundations of stepwise verification

Acta Informatica

Volumn 48, Issue 4, 2011, Pages 213-242

  Polyvyanyy, Artem ^a   Weidlich, Matthias ^a   Weske, Mathias ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79960839570     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-011-0137-8     Document Type: Article

References (45)

1. Berthelot, G.: Checking properties of nets using transformation. In: ATPN. Volume 222 of Lecture Notes in Computer Science. Springer, Berlin, pp. 19-40 (1986).
2. Berthelot, G.: Transformations and decompositions of nets. In: Advances in Petri Nets. Volume 254 of Lecture Notes in Computer Science. Springer, Berlin, pp. 359-376 (1987).
3. Battista, G. D., Tamassia, R.: On-line graph algorithms with SPQR-trees. In: ICALP. Volume 443 of Lecture Notes in Computer Science. Springer, Berlin, pp. 598-611 (1990).
4. Desel J., Esparza J.: Free Choice Petri Nets. Cambridge University Press, Cambridge (1995).
5. Diestel R.: Graph Theory. Springer, Berlin (2005).
6. Eshuis R., Wieringa R.: Tool support for verifying UML activity diagrams. IEEE Trans. Softw. Eng. (TSE) 30(7), 437-447 (2004).
7. Esparza, J., Silva, M.: Circuits, handles, bridges and nets. In: ATPN. Volume 483 of Lecture Notes in Computer Science. Springer, Berlin, pp. 210-242 (1991).
8. Fahland, D., Favre, C., Jobstmann, B., Koehler, J., Lohmann, N., Völzer H., Wolf K.: Instantaneous soundness checking of industrial business process models. In: BPM. Volume 5701 of Lecture Notes in Computer Science. Springer, Berlin, pp. 278-293 (2009).
9. Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Graph Drawing. Volume 1984 of Lecture Notes in Computer Science. Springer, Berlin, pp. 77-90 (2001).
10. Hopcroft J., Tarjan R. E.: Dividing a graph into triconnected components. SIAM J. Comput. (SIAMCOMP) 2(3), 135-158 (1973).
11. Hopcroft J., Tarjan R. E.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM (CACM) 16(6), 372-378 (1973).
12. Johnson, R. C.: Efficient Program Analysis Using Dependence Flow Graphs. PhD thesis, Cornell University, Ithaca, NY, USA (1995).
13. Kemper, P.: Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net. In: ATPN. Volume 691 of Lecture Notes in Computer Science. Springer, Berlin, pp. 319-338 (1993).
14. Keller, G., Nüttgens, M., Scheer, A. W.: Semantische Prozeßmodellierung auf der Grundlage 'Ereignisgesteuerter Prozeßketten (EPK)'. Veröffentlichungen des Instituts für schaftsinformatik (IWi), Universität des Saarlandes (January 1992) In German.
15. Kiepuszewski B., ter Hofstede A. H. M., van der Aalst W. M. P.: Fundamentals of control flow in workflows. Acta Informatica 39(3), 143-209 (2003).
16. Kindler, E.: On the semantics of EPCs: A framework for resolving the vicious circle. In: BPM. Volume 3080 of Lecture Notes in Computer Science. Springer, Berlin, pp. 82-97 (2004).
17. Lohmann, N.: A feature-complete Petri net semantics for WS-BPEL 2. 0. In: WS-FM. Volume 4937 of Lecture Notes in Computer Science. Springer, Berlin, pp. 77-91 (2008).
18. Lohmann N., Verbeek E., Dijkman R. M.: Petri net transformations for business processes-a survey. Trans. Petri Nets Other Models Concurr. (TOPNOC) 2, 46-63 (2009).
19. Menger K.: Zur allgemeinen Kurventheorie. Fund. Math. 10, 96-115 (1927).
20. Murata T.: Petri nets: properties, analysis and applications. Proc. IEEE (PIEEE) 77(4), 541-580 (1989).
21. Object Management Group: Unified Modeling Language: Superstructure (UML) version 2. 1. 1(February 2007).
22. Object Management Group: Business Process Model and Notation (BPMN) version 2. 0 beta 2 (June 2010).
23. Polyvyanyy, A., Smirnov, S., Weske, M.: The triconnected abstraction of process models. In: BPM. Volume 5701 of Lecture Notes in Computer Science. Springer, Berlin, pp. 229-244 (2009).
24. Polyvyanyy, A.: Structural abstraction of process specifications. In: ZEUS. Volume 563 of CEUR Workshop Proceedings. CEUR-WS. org, pp. 73-79 (2010).
25. Polyvyanyy, A., Weidlich, M., Weske, M.: The biconnected verification of workflow nets. In: OTM Conferences (1). Volume 6426 of Lecture Notes in Computer Science. Springer, Berlin, pp. 410-418 (2010).
26. Polyvyanyy, A., Vanhatalo, J., Völzer, H.: Simplified computation and generalization of the refined process structure tree. In: WS-FM. Volume 6551 of Lecture Notes in Computer Science. Springer, Berlin, pp. 25-41 (2011).
27. Reisig, W.: Petri Nets: An Introduction. Volume 4 of Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin (1985).
28. Skiena S. S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, Reading (1990).
29. Tarjan R. E.: Depth-first search and linear graph algorithms. SIAM J. Comput. (SIAMCOMP) 1(2), 146-160 (1972).
30. Valette R.: Analysis of petri nets by stepwise refinements. J. Comput. Syst. Sci. (JCSS) 18(1), 35-46 (1979).
31. Tarjan, R. E., Valdes, J.: Prime subprogram parsing of a program. In: POPL, pp. 95-105 (1980).
32. van der Aalst, W. M. P.: Verification of workflow nets. In: ICATPN. Volume 1248 of Lecture Notes in Computer Science. Springer, Berlin, pp. 407-426 (1997).
33. van der Aalst W. M. P.: The application of Petri nets to workflow management. J. Circuits Syst. Comput. (JCSC) 8(1), 21-66 (1998).
34. van der Aalst, W. M. P.: Workflow verification: finding control-flow errors using Petri-net-based techniques. In: BPM. Volume 1806 of Lecture Notes in Computer Science. Springer, Berlin, pp 161-183 (2000).
35. Vanhatalo, J., Völzer, H., Leymann, F.: Faster and more focused control-flow analysis for business process models through SESE decomposition. In: ICSOC. Volume 4749 of Lecture Notes in Computer Science. Springer, Berlin, pp. 43-55 (2007).
36. Vanhatalo, J., Völzer, H., Koehler, J.: The refined process structure tree. In: BPM. Volume 5240 of Lecture Notes in Computer Science. Springer, Berlin, pp. 100-115 (2008).
37. Vanhatalo J., Völzer H., Koehler J.: The refined process structure tree. Data Knowl. Eng. (DKE) 68(9), 793-818 (2009).
38. Verbeek E., Basten T., van der Aalst W. M. P.: Diagnosing workflow processes using woflan. Comput. J. (CJ) 44(4), 246-279 (2001).
39. Verbeek E., Wynn M. T., van der Aalst W. M. P., ter Hofstede A. H. M.: Reduction rules for reset/inhibitor nets. J. Comput. Syst. Sci. (JCSS) 76(2), 125-143 (2010).
40. van der Aalst W. M. P., Basten T.: Inheritance of workflows: an approach to tackling problems related to change. Theor. Comput. Sci. (TCS) 270(1-2), 125-203 (2002).
41. Weidlich, M., Polyvyanyy, A., Mendling J., Weske M.: Efficient computation of causal behavioural profiles using structural decomposition. In: Petri Nets. Volume 6128 of Lecture Notes in Computer Science. Springer, Berlin, pp. 63-83 (2010).
42. Weske M.: Business Process Management: Concepts Languages Architectures. Springer, Berlin (2007).
43. Wolf, K.: Generating Petri net state spaces. In: ICATPN. Volume 4546 of Lecture Notes in Computer Science. Springer, Berlin, pp. 29-42 (2007).
44. Wynn M. T., Verbeek E., van der Aalst W. M. P., ter Hofstede A. H. M., Edmond D.: Soundness-preserving reduction rules for reset workflow nets. Inf. Sci. (ISCI) 179(6), 769-790 (2009).
45. Wynn M. T., Verbeek E., van der Aalst W. M. P., ter Hofstede A. H. M., Edmond D.: Reduction rules for YAWL workflows with cancellation regions and OR-joins. Inf. Softw. Technol. (INFSOF) 51(6), 1010-1020 (2009).