An efficient approach to detect lack of synchronization in acyclic workflow graphs

CEUR Workshop Proceedings

Volumn 563, Issue , 2010, Pages 57-64

  Favre, Cédric ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BUSINESS PROCESS MODEL; CONTROL-FLOW; CONTROL-FLOW ANALYSIS; QUADRATIC TIME; WORKFLOW GRAPH;

FLOW GRAPHS;

SYNCHRONIZATION;

EID: 78049242824     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. W. van der Aalst, A. Hirnschall, and H. Verbeek, "An alternative way to analyze workflow graphs, " Lecture Notes in Computer Science, pp. 535-552, 2002.
2. Y. Perl and Y. Shiloach, "Finding two disjoint paths between two pairs of vertices in a graph, " J. Assoc. Comput. Mach, vol. 25, no. 1, p. 9, 1978.
3. J. Esparza and M. Silva, "Circuits, handles, bridges and nets, " Advances in Petri nets, vol. 483, pp. 210-242, 1990.
4. W. van der Aalst, "Workflow verification: Finding control-flow errors using Petrinet- based techniques, " Lecture Notes in Computer Science, pp. 161-183, 2000.
5. A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum-flow problem, " J. ACM, vol. 35, no. 4, pp. 921-940, 1988.
6. F. Harary, "Graph Theory. 1969.".
7. J. Gross and J. Yellen, Graph theory and its applications. CRC press, 2006.
8. B. Yang, S. Zheng, and E. Lu, "Finding two Disjoint Paths in a Network with Normalized-Min-Sum Objective Function, " 2005.