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. (c) 2005 Elsevier B.V. All rights reserved.
soundness workflow net decidability petri net algorithms