An Alternative Way to Analyze Workflow Graphs
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
Improving process models by discovering decision points
Information Systems
Terminability and compensatibility of cycles in business processes with a process-oriented trigger
Data & Knowledge Engineering
Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
An Efficient Algorithm for Workflow Graph Structural Verification
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
A modeling method based on CCS for workflow
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Unveiling Hidden Unstructured Regions in Process Models
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Formalization and verification of EPCs with OR-joins based on state and context
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
An integer programming based approach for verification and diagnosis of workflows
Data & Knowledge Engineering
Application of if-conversion to verification and optimization of workflows
Programming and Computing Software
Decomposition-based verification of cyclic workflows
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Verification of EPCs: using reduction rules and petri nets
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
An algorithm of automatic workflow optimization
Programming and Computing Software
Ensuring correctness during process configuration via partner synthesis
Information Systems
Minimizing test-point allocation to improve diagnosability in business process models
Journal of Systems and Software
| Hi-index | 0.00 |
The algorithm [1] is based on a set of graph reduction rules to identify the deadlock and lack of synchronization conflicts that could compromise the correct execution of a workflow. However, an example, which is apparently correct but cannot be reduced by the rules, shows the incompleteness of the algorithm. In this paper, we present a complete and minimal set of rules and a novel algorithm to implement the identification of structural conflicts in process models. The correctness and completeness of the algorithm is strictly proved. Finally, the complexity of the algorithm is analyzed.