Fast Soundness Verification of Workflow Graphs

Thomas M. Prinz
2013 Central-European Workshop on Services and their Composition  
This paper shows a new approach to check the soundness of workflow graphs. The algorithm is complete and allows a very good localization of the structural conflicts, i.e. local deadlocks and lack of synchronizations. The evaluation shows a linear processing time in the average and an up to quadratic in the worst case.
dblp:conf/zeus/Prinz13 fatcat:byuz732gwnb5zpnbjy3ll7bfhm