We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/Soundness of workflow nets: classification, decidability, and analysis
PeriodicalsComputer Science & Information Technology

Soundness of workflow nets: classification, decidability, and analysis

Checking your access to this record.

Abstract & Overview

Abstract Workflow nets, a particular class of Petri nets, have become one of the standard ways to model and analyze workflows. Typically, they are used as an abstraction of the workflow that is used to check the so-calledsoundness property. This property guarantees the absence of livelocks, deadlocks, and other anomalies that can be detected without domain knowledge. Several authors have proposed alternative notions of soundness and have suggested to use more expressive languages, e.g., models with cancellations or priorities. This paper provides anoverview of the different notions of soundness and investigates these in the presence of different extensions of workflow nets. We will show that the eight soundness notions described in the literature are decidable for workflow nets. However, most extensions will make all of these notions undecidable. These new results show the theoretical limits of workflow verification. Moreover, we discuss some of the analysis approaches described in the literature.

Cite this record

Wil M. P. van der Aalst, Kees M. van Hee, Arthur H. M. ter Hofstede, Natalia Sidorova, H. M. W. Verbeek, Marc Voorhoeve, et al. (2010). Soundness of workflow nets: classification, decidability, and analysis. Formal Aspects of Computing, 23(3), 333–363. https://doi.org/10.1007/s00165-010-0161-4

Copy in another style

Aalst, W. M. P. V. D., Hee, K. M. V., Hofstede, A. H. M. T., Sidorova, N., Verbeek, H. M. W., Voorhoeve, M., & Wynn, M. T. (2010). Soundness of workflow nets: classification, decidability, and analysis. Formal Aspects of Computing, 23(3), 333–363. https://doi.org/10.1007/s00165-010-0161-4
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.