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.

View at publisher


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:

4 citations in Scopus
Search Google Scholar™
3 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

275 since deposited on 17 Mar 2011
21 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 40782
Item Type: Journal Article
Refereed: Yes
Keywords: Petri Nets, Workflow Nets, Reset Nets, Soundness, Verification , Decidability
DOI: 10.1007/978-3-642-04856-2_3
ISSN: 0302-9743
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

Deposited On: 17 Mar 2011 00:20
Last Modified: 21 Apr 2015 04:46

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page