| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331936 | Information Processing Letters | 2005 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ferucio Laurenţiu Ţiplea, Dan Cristian Marinescu,