Soundness of workflow nets with reset arcs

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: Chapter in Book/Report/Conference proceedingChapterAcademic

5 Citations (Scopus)
1 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationTransactions on Petri nets and other models of concurrency III
EditorsK. Jensen, J. Billington, M. Koutny
Place of PublicationBerlin
PublisherSpringer
Pages50-70
ISBN (Print)978-3-642-04854-8
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
Volume5800
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Soundness of workflow nets with reset arcs'. Together they form a unique fingerprint.

Cite this