Soundness of workflow nets with reset arcs
van der Aalst, Wil M. P., Hee, Kees M., ter Hofstede, Arthur H. M., Sidorova, Natalia, Verbeek, H. M. W., Voorhoeve, Marc, & Wynn, Moe T. (2009) Soundness of workflow nets with reset arcs. Lecture Notes in Computer Science: Transactions on Petri Nets and Other Models of Concurrency III, 5800, pp. 50-70.
Petri nets are often used to model and analyze workflows. Many workflow languages have been mapped onto Petri nets in order to provide formal semantics or to verify correctness properties. Typically, the so-called Workflow nets are used to model and analyze workflows and variants of the classical soundness property are used as a correctness notion. Since many workflow languages have cancelation features, a mapping to workflow nets is not always possible. Therefore, it is interesting to consider workflow nets with reset arcs. Unfortunately, soundness is undecidable for workflow nets with reset arcs. In this paper, we provide a proof and insights into the theoretical limits of workflow verification.
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, Workflow Nets, Reset Nets, Soundness, Verification , Decidability|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > INFORMATION SYSTEMS (080600)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology
Past > Schools > Information Systems
|Copyright Owner:||Copyright 2009 Springer-Verlag Berlin Heidelberg|
|Copyright Statement:||This is the author-version of the work. Lecture Notes in Computer Science, published by Springer Verlag, are available via SpringerLink http://www.springer.de/comp/lncs/|
|Deposited On:||17 Mar 2011 00:20|
|Last Modified:||21 Apr 2015 04:46|
Repository Staff Only: item control page