Soundness of workflow nets: classification, decidability, and analysis

@article{vanderAalst2010SoundnessOW,
  title={Soundness of workflow nets: classification, decidability, and analysis},
  author={Wil M.P. van der Aalst and Kees M. van Hee and Arthur H. M. ter Hofstede and Natalia V. Sidorova and Henricus M. W. Verbeek and Marc Voorhoeve and Moe Thandar Wynn},
  journal={Formal Aspects of Computing},
  year={2010},
  volume={23},
  pages={333-363}
}
Workflow nets, a particular class of Petri nets, have become one of the standard ways to model and analyze workflows. [] Key Result These new results show the theoretical limits of workflow verification. Moreover, we discuss some of the analysis approaches described in the literature.
Complexity of the Soundness Problem of Bounded Workflow Nets
TLDR
It is shown that the satisfiability problem of Boolean expression is polynomial time reducible to the liveness problem of bounded WF-nets, and soundness and liveness are equivalent for bounded WFs, and it is proved that the soundness problem of bound reWF-nets is PSPACE-hard.
A Branching-Process-Based Method to Check Soundness of Workflow Systems
TLDR
This paper proposes an algorithm to generate a finite prefix of the unfolding of a WF-net, called basic unfolding, and a necessary and sufficient condition is proposed to decide soundness based on basic unfolding.
Complexity of the Soundness Problem of Workflow Nets
TLDR
The soundness problem is co-NP-hard for asymmetric-choice WF-nets that are a larger class and can model more cases of interaction and resource allocation than free-choice ones and is derived that the soundness problems are also PSPACE-complete for bounded Wf-nets with reset or inhibitor arcs.
Soundness of workflow nets with reset arcs is undecidable
TLDR
This paper provides a proof and insights into the theoretical limits of workflow verification and variants of the classical soundness property are used as a correctness notion in Petri nets.
Soundness of Workflow Nets with Reset Arcs
TLDR
A proof and insights into the theoretical limits of workflow verification are provided and variants of the classical soundness property are used as a correctness notion.
Soundness of Timed-Arc Workflow Nets
TLDR
It is shown, among others, that soundness is decidable for monotonic workflow nets while reachability is undecidable, for general timed-arc workflow nets soundness and strong soundness become undec formidable, though one can design efficient verification algorithms for the subclass of bounded nets.
Discovery, Verification and Conformance of Workflows with Cancellation
TLDR
This paper proposes to use reset workflow nets (RWF- nets) and discusses the discovery of RWF-nets and the verification of RWf-nets, as well as the conformance of an event log with respect to a RWF, and comparing real with modeled behavior.
Assessing SMT and CLP approaches for workflow nets verification
TLDR
The goal of this paper is to evaluate and compare in a deep way two resolution methods—satisfiability modulo theory and constraint logic programming—applied to the verification of modal specifications over workflow nets.
Cost Soundness for Priced Resource-Constrained Workflow Nets
TLDR
This work extends workflow Petri nets with discrete prices, by associating a price to the execution of a transition and, more importantly, to the storage of tokens, by developing a framework in which to study soundness for priced rcwf-nets, that is parametric on the cost model.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 127 REFERENCES
Generalised Soundness of Workflow Nets Is Decidable
TLDR
Algebraic methods are used to prove that generalized soundness is decidable for BWF-nets and give a decision procedure.
Soundness of Workflow Nets with Reset Arcs
TLDR
A proof and insights into the theoretical limits of workflow verification are provided and variants of the classical soundness property are used as a correctness notion.
An Alternative Way to Analyze Workflow Graphs
TLDR
The set of reduction rules presented in [19] is not complete and an alternative algorithm is proposed that translates workflow graphs into so-called WF-nets, a class of Petri nets tailored towards workflow analysis.
Model checking of workflow schemas
TLDR
An approach for formal verification of workflow schemas (definitions) by means of an automata-based method, which facilitates exhaustive compositional reachability analysis and is accessible by designers who are not experts in formal methods.
Achieving a General, Formal and Decidable Approach to the OR-Join in Workflow Using Reset Nets
TLDR
The concept of OR-join is examined in detail in the context of the workflow language YAWL, a powerful workflow language designed to support a collection of workflow patterns and inspired by Petri nets.
Verifying Workflows with Cancellation Regions and OR-joins: An Approach Based on Relaxed Soundness and Invariants
TLDR
A verification approach based on an abstraction of the OR-join semantics; the relaxed soundness property; and transition invariants can be used to successfully detect errors in YAWL models and can be easily transferred to other workflow languages allowing for advanced constructs such as cancellations and OR-joins.
Verifying Workflows with Cancellation Regions and OR-Joins: An Approach Based on Reset Nets and Reachability Analysis
TLDR
This work takes on the challenge of finding new verification techniques for workflows with cancellation regions and OR-joins by using reset nets and reachability analysis in the context of workflow language YAWL that provides direct support for these features.
Reduction rules for reset workflow nets
TLDR
This paper proposes a number of reduction rules for Reset Workflow Nets (RWF-nets) that are soundness preserving and presents the necessary conditions under which these rules hold in the context of reset nets.
...
1
2
3
4
5
...