Structural soundness of workflow nets is decidable

The problem of deciding whether a given workflow net is k-sound for some k⩾1 is known as structural soundness. We prove that structural soundness of workflow nets is decidable.