Soundness of Workflow Nets with Reset Arcs

Authors:
Wil M. Aalst;Kees M. Hee;Arthur H. Hofstede;Natalia Sidorova;H. M. Verbeek;Marc Voorhoeve;Moe T. Wynn
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands NL-5600 and Business Process Management Group, Queensland University of Technology, B ...;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands NL-5600;Business Process Management Group, Queensland University of Technology, Brisbane, Australia 4001;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands NL-5600;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands NL-5600;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands NL-5600;Business Process Management Group, Queensland University of Technology, Brisbane, Australia 4001
Venue:
Transactions on Petri Nets and Other Models of Concurrency III
Year:
2009

Citing 0
Cited 2

Dynamic soundness in resource-constrained workflow nets

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Diagnosing correctness of semantic workflow models

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.