This paper proposes a reduction method to verify the generalised soundness of large workflows described as workflow nets–a suited class of Petri nets. The proposed static analysis method is based on the application of six novel reduction transformations that transform a workflow net into a smaller one while preserving generalised soundness. The soundness of the method is proved. As practical contributions, this paper presents convincing experimental results obtained using a dedicated tool, developed to validate and demonstrate the effectiveness, efficiency and scalability of this method over a large set of industrial workflow nets.
CITATION STYLE
Bride, H., Kouchnarenko, O., & Peureux, F. (2017). Reduction of workflow nets for generalised soundness verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10145 LNCS, pp. 91–111). Springer Verlag. https://doi.org/10.1007/978-3-319-52234-0_6
Mendeley helps you to discover research relevant for your work.