Analyzing Process Models Using Graph Reduction Techniques

By Wasim Sadiq, Maria E. Orlowska. Information Systems, 2000

530 citations recorded by the source corpus.

Subfields: Information Systems, Management Information Systems, Software

View Paper: https://www.semanticscholar.org/paper/866c32df91515c07e74e1da3fe01caf272a32b0c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Information Systems

1. Wil M.P. van der Aalst
2. Mathias Weske
3. A. T. Hofstede
4. H. Verbeek
5. Shazia Wasim Sadiq
6. Ahmed Awad
7. Gero Decker
8. Hagen Völzer

In Management Information Systems

1. Wil M.P. van der Aalst
2. Mathias Weske
3. Manfred Reichert
4. Bernd Weber
5. A. T. Hofstede
6. H. Verbeek
7. Hagen Völzer
8. Jussi Vanhatalo

In Software

1. Hagen Völzer
2. Jussi Vanhatalo
3. Ahmed Awad
4. Frank Leymann
5. Gero Decker
6. Mathias Weske
7. Shazia Wasim Sadiq
8. Wasim Sadiq

Citations in the corpus

• The refined process structure tree (2008, unknown): “1 Introduction The control flow of a business process can often be modeled as a workflow graph [10].”
• Business Process Analysis and Optimization: Beyond Reengineering (2008, background): “Sadiq and Orlowska [62] identify and try to analyze and resolve two structural conflicts in process models: deadlock and lack of synchronization. van der Aalst et al. [76] regard the previous approach as incomplete and propose a new algorithm.”
• Specification and validation of process constraints for flexible workflows (2005, methodology): “The elimination of the choice-merge construct from the template, further has the advantage of removing the chance of structural errors such as deadlocks or lack of synchronization [ 6 ].”
• Soundness of workflow nets: classification, decidability, and analysis (2011, background): “Some authors assume a model that is less expressive than WF-nets, e.g., there are many variants of the so-called workflow graph model [SO00] which is essentially a free-choice net and thus easier to analyze than WF-nets without restrictions.”
• Introduction to the Special Issue with Best Papers from BPM 2008 Workshops (2010, unknown): “[10]).”
• Efficient Compliance Checking Using BPMN-Q and Temporal Logic (2008, methodology): “Graph Reduction Reduction rules have been successfully used either as a stand alone approach [23,24], or as an engineering approach used to reduce the complexity of the process models [27,19] to verify correctness of process models.”
• Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition (2007, methodology): “A workflow graph that has no structural errors such as deadlocksor lack of synchronization [11] is said to besound[14].”