Soundness of workflow nets : classification, decidability, and analysis

W.M.P. Aalst, van der, K.M. Hee, van, A.H.M. Hofstede, ter, N. Sidorova, H.M.W. Verbeek, M. Voorhoeve, M.T. Wynn

Research output: Contribution to journalArticleAcademicpeer-review

302 Citations (Scopus)
211 Downloads (Pure)


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-called soundness 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 an overview 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.
Original languageEnglish
Pages (from-to)333-363
JournalFormal Aspects of Computing
Issue number3
Publication statusPublished - 2011


Dive into the research topics of 'Soundness of workflow nets : classification, decidability, and analysis'. Together they form a unique fingerprint.

Cite this