Structural soundness of workflow nets is decidable
Abbreviated Journal Title
Inf. Process. Lett.
Petri net; workflow net; soundness; decidability; algorithms; Computer Science, Information Systems
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.
Information Processing Letters
"Structural soundness of workflow nets is decidable" (2005). Faculty Bibliography 2000s. 5724.