Soundness of workflow nets: classification, decidability, and analysis
Citations
739 citations
358 citations
Cites background from "Soundness of workflow nets: classif..."
...Hiding corresponds to abstraction, i.e. the execution of an activity becomes unobservable, but the path the activity is in, is still possible....
[...]
...A typical requirement is soundness [van der Aalst et al. 2011], i.e., it should always be possible to complete any process instance properly....
[...]
350 citations
279 citations
156 citations
References
10,755 citations
"Soundness of workflow nets: classif..." refers background or methods in this paper
...It is easy to see that invariants are less useful for nets with reset arcs because these arcs destroy the nice linear algebraic properties that follow from the marking equation [62, 65]....
[...]
...Note that all the classical liveness and boundedness preserving reduction rules [12, 13, 62] that do not depend on the initial marking also preserve the other notions of soundness....
[...]
...Even in this simple setting it is not possible to use the coverability graph [62] to decide soundness....
[...]
...We can apply the liveness and boundedness preserving reduction rules of [12, 13, 62] to get this result, because a WF-net is classical sound if and only if the corresponding short-circuited net is live and bounded [1, 2]....
[...]
...The construction of a coverability graph is one of the standard approaches for analyzing classical Petri nets [62, 65]....
[...]
2,862 citations
[...]
2,553 citations
2,041 citations
1,825 citations
"Soundness of workflow nets: classif..." refers background in this paper
...Early examples of process-aware information systems were called WorkFlow Management (WFM) systems [AH04, GHS95, JB96, LR99, Mue04, Wes07 ]....
[...]