Verifying generalised and structural soundness of workflow nets via relaxations

TL;DR

This paper introduces scalable semi-procedures for verifying the generalised and structural soundness of workflow nets using Petri net reachability relaxations, improving over existing tools.

Contribution

It presents novel relaxations and semi-procedures for assessing generalised and structural soundness, expanding the verification capabilities beyond $k$-soundness.

Findings

Approach is competitive with state-of-the-art tools.

Scalable semi-procedures for complex soundness properties.

Utilizes integral and continuous Petri net reachability relaxations.

Abstract

Workflow nets are a well-established mathematical formalism for the analysis of business processes arising from either modeling tools or process mining. The central decision problems for workflow nets are $k$-soundness, generalised soundness and structural soundness. Most existing tools focus on $k$-soundness. In this work, we propose novel scalable semi-procedures for generalised and structural soundness. This is achieved via integral and continuous Petri net reachability relaxations. We show that our approach is competitive against state-of-the-art tools.