Soundness of workflow nets: classification, decidability, and analysis
van der Aalst, Wil, van Hee, Kees, ter Hofstede, Arthur, Sidorova, Natalia, Verbeek, H.M.W., Voorhoeve, Marc, & Wynn, Moe (2010) Soundness of workflow nets: classification, decidability, and analysis. Formal Aspects of Computing: applicable formal methods, 23(3), pp. 333-363.
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.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Keywords:||Petri nets, Decidability, Workflow nets, Reset nets, Soundness, Verification|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > COMPUTATION THEORY AND MATHEMATICS (080200)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology
Past > Schools > Information Systems
|Deposited On:||13 Jul 2011 13:09|
|Last Modified:||03 Dec 2012 02:07|
Repository Staff Only: item control page