Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach

Hee, Kees van; Sidorova, Natalia; Voorhoeve, Marc

doi:10.1007/3-540-44919-1_22

Cited by 86 publications

(41 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Soundness of workflow nets: classification, decidability, and analysis

et al. 2011

View full text Add to dashboard Cite

Abstract. Workflow nets, a particular class of Petri nets, have become one of the standard ways to model and analyze workflows. Typically, they are used as an abstraction of the workflow that is used to check the so-called soundness property. This property guarantees the absence of livelocks, deadlocks, and other anomalies that can be detected without domain knowledge. Several authors have proposed alternative notions of soundness and have suggested to use more expressive languages, e.g., models with cancellations or priorities. This paper provides an overview of the different notions of soundness and investigates these in the presence of different extensions of workflow nets. We will show that the eight soundness notions described in the literature are decidable for workflow nets. However, most extensions will make all of these notions undecidable. These new results show the theoretical limits of workflow verification. Moreover, we discuss some of the analysis approaches described in the literature.

show abstract

Section: Related Workmentioning

confidence: 99%

“…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.…”

Section: Related Workmentioning

confidence: 99%

Soundness of workflow nets: classification, decidability, and analysis

et al. 2011

View full text Add to dashboard Cite

show abstract

“…Therefore, it is important to understand why and in which circum-42 stances errors occur. Several research in software engineering was conducted 43 on complexity metrics as determinants for errors (see e.g. [18][19][20][21][22] understood.…”

mentioning

confidence: 99%

Detection and prediction of errors in EPCs of the SAP reference model

Mendling

Verbeek

Dongen

et al. 2008

Data & Knowledge Engineering

179

112

View full text Add to dashboard Cite

Up to now there is neither data available on how many errors can be expected in process model collections, nor is it understood why errors are introduced. In this article, we provide empirical evidence for these questions based on the SAP reference model. This model collection contains about 600 process models expressed as Eventdriven Process Chains (EPCs). We translated these EPCs into YAWL models, and analyzed them using the verification tool WofYAWL. We discovered that at least 34 of these EPCs contain errors. Moreover, we used logistic regression to show that complexity of EPCs has a significant impact on error probability.

show abstract

“…One natural correctness requirement is proper termination, which is called soundness in the WF-net theory. We will use the generalised notion of soundness for WF-nets introduced in [11]:…”

Section: Definition 1 (Wf-net)mentioning

confidence: 99%

“…We adapt the notion of generalised soundness introduced for WF-nets [11] to the nature of RCWF-nets: We say that an RCWF-net with k case tokens (tokens on the initial place of the production net) and a resource marking R is (k , R)-sound iff all cases can terminate properly, whatever choices are made during the execution, and all resources are returned to their places. We will say that an RCWF-net is sound iff there exists a resource marking R 0 such that the RCWFnet is (k , R)-sound for any number of cases k and any resource marking R ≥ R 0 .…”

Section: Introductionmentioning

confidence: 99%

Soundness of Resource-Constrained Workflow Nets

Hee

Serebrenik

Sidorova

et al. 2005

Applications and Theory of Petri Nets 2005

Self Cite

View full text Add to dashboard Cite

Abstract. We study concurrent processes modelled as workflow Petri nets extended with resource constraints. We define a behavioural correctness criterion called soundness: given a sufficient initial number of resources, all cases in the net are guaranteed to terminate successfully, no matter which schedule is used. We give a necessary and sufficient condition for soundness and an algorithm that checks it.

show abstract

Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach

Cited by 86 publications

References 6 publications

Soundness of workflow nets: classification, decidability, and analysis

Soundness of workflow nets: classification, decidability, and analysis

Detection and prediction of errors in EPCs of the SAP reference model

Soundness of Resource-Constrained Workflow Nets

Contact Info

Product

Resources

About