Generalised Soundness of Workflow Nets Is Decidable

Abstract

DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

Soundness of workflow nets: classification, decidability, and analysis

“…In [Aal97,Aal98] the foundational notions of WF-nets and soundness are introduced. In [HSV03,HSV04] two alternative notions of soundness are introduced: k -soundness and generalized soundness. These notions allow for dead parts in the workflow but address problems related to multiple instantiation.…”

“…Most soundness notions (except generalized soundness [HSV03,HSV04]) can be investigated using classical model checking techniques that explore the state space. However, such approaches can be intractable or even impossible because the state-space may be infinite.…”

“…In Lemma 11 in [HSV04] it is shown that also for k -soundness the "option to complete" implies "proper completion" (like for classical soundness). We introduce k -soundness mainly to be able to define useful notions such as weak soundness and generalized soundness.…”

“…The reason is that the problem corresponds to inspecting infinitely many coverability graphs. Fortunately, in [HSV04] it was shown that generalized soundness is decidable for WF-nets without reset and/or inhibitor arcs.…”

“…In general, the coverability graph (or a set of coverability graphs) can be used to decide on any type of soundness except for generalized soundness. For generalized soundness one can use the approach described in [HSV04].…”