Symbolic execution of acyclic workflow graphs

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

Volumn 6336 LNCS, Issue , 2010, Pages 260-275

  Favre, Cédric ^a   Völzer, Hagen ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; ENTERPRISE RESOURCE MANAGEMENT; MODEL CHECKING;

BUSINESS PROCESS MODEL; CONTROL FLOWS; DATA FLOW; QUADRATIC TIME; SYMBOLIC EXECUTION; WORKFLOW GRAPH;

FLOW GRAPHS;

EID: 78049294670     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15618-2_19     Document Type: Conference Paper

References (20)

1. Mendling, J.: Empirical Studies in Process Model Verification. T. Petri Nets and Other Models of Concurrency (ToPNoC) 2, 208-224 (2009)
2. Weidlich, M., Polyvyanyy, A., Mendling, J., Weske, M.: Efficient Computation of Causal Behavioural Profiles using Structural Decomposition. Technical Report BPT 10, HPI (2010)
3. Desel, J., Esparza, J.: Free choice Petri nets. Cambridge tracts in theoretical computer science, vol. 40. Cambridge University Press, Cambridge (1995)
4. Esparza, J.: Reduction and synthesis of live and bounded free choice Petri nets. Information and Computation 114(1), 50-87 (1994)
5. Fahland, D., Favre, C., Jobstmann, B., Koehler, J., Lohmann, N., Völzer, H., Wolf, K.: Instantaneous soundness checking of industrial business process models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H. A. (eds.) BPM. LNCS, vol. 5701, pp. 278-293. Springer, Heidelberg (2009)
6. Sadiq, W., Orlowska, M. E.: Analyzing process models using graph reduction techniques. Inf. Syst. 25(2), 117-134 (2000)
7. Mendling, J.: Detection and Prediction of Errors in EPC Business Process Models. PhD thesis, Vienna University of Economics and Business Administration, Vienna, Austria (2007)
8. Wynn, M., Verbeek, H., Aalst, W., Hofstede, A., Edmond, D.: Business process verificationfinally a reality! Business Process Management Journal 15(1), 74-92 (2009)
9. Dehnert, J., Rittgen, P.: Relaxed soundness of business processes. In: Dittrich, K. R., Geppert, A., Norrie, M. C. (eds.) CAiSE 2001. LNCS, vol. 2068, pp. 157-170. Springer, Heidelberg (2001) (Pubitemid 33285689)
10. Martens, A.: On compatibility of web services. Petri Net Newsletter 65, 12-20 (2003)
11. Favre, C, Völzer, H.: Symbolic execution of acyclic workflow graphs. Technical Report RZ3780, IBM Research (2010)
12. Völzer, H.: A new semantics for the inclusive converging gateway in safe processes. In: Hull, R., Mendling, J., Tai, S. (eds.) BPM 2010. LNCS, vol. 6336, pp. 285-300. Springer, Heidelberg (2010)
13. van der Aalst, W.: Workflow verification: Finding control-flow errors using Petri-net-based techniques. In: van der Aalst, W., Desel, J., Oberweis, A. (eds.) BPM 2000. LNCS, vol. 1806, pp. 161-183. Springer, Heidelberg (2000)
14. Esparza, J., Silva, M.: Circuits, handles, bridges and nets. Advances in Petri nets 483, 210-242 (1990)
15. Goldberg, A. V., Tarjan, R. E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921-940 (1988)
16. Pearl, Y., Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM (JACM) 25(1), 1-9 (1978)
17. Favre, C: An efficient approach to detect lack of synchronization in acyclic workflow graphs. In: ZEUS. CEUR Workshop Proceedings, vol. 563, pp. 57-64 (2010)
18. Kovalyov, A., Esparza, J.: A Polynomial Algorithm to Compute the Concurrency Relation of Free-Choice Signal Transition Graphs. In: Proc. of the International Workshop on Discrete Event Systems, WODES 1996, The Institution of Electrical Engineers, Edinburgh, pp. 1-6 (1996)
19. Vanhatalo, J., Völzer, H., Koehler, J.: The refined process structure tree. Data Knowl. Eng. 68(9), 793-818 (2009)
20. Vanhatalo, J.: Process Structure Trees: Decomposing a Business Process Model into a Hierarchy of Single-Entry-Single-Exit Fragments. PhD thesis, Universität Stuttgart (2009)