Following is a partial list of the rules that are enforced during
workflow validation.
- The workflow starts at the launch step; all steps must be reachable
from the launch step.
Table 1. Workflow
from the launch step. Workflow from the launch step
Diagram |
Explanation |
 |
Two steps cannot be reached: the step at the lower left is
not connected by any route; from the last step on the right, the route
goes in the wrong direction so the step could never be reached. |
- Maps must be properly and fully nested with regard to AND-splits
and AND-joins, which means that all of the following must be true:
- For each AND-split step, there must be one AND-join (collector)
step.
If you selected All true conditions as
the outgoing routing for a step (thus specified an AND-split), you
must specify a subsequent step in the path as a Collector Step (an
AND-join) to define a valid workflow. The AND-join step can immediately
follow the AND-split step, or there can be one or more steps in between.
Table 2. Workflow from the join step. Workflow from the join step
Diagram |
Explanation |
 |
All three routes from the Split will meet at the Join. |
- All paths from the AND-split step can meet at the AND-join step,
or one or more paths can terminate—that is, end without going to the
AND-join step. (A path is defined as a sequence of contiguous routes
that can be followed between a set of steps.)
Table 3. Workflow from the AND-split step. Workflow from the AND-split step
Diagram |
Explanation |
 |
One path from the Split terminates at step A, but the paths
with steps B and C proceed to the collector step (Join). Note that
at least one path from the Split must go to the Join. |
- A path that passes through an AND-split step cannot return to
that step without first passing through the corresponding AND-join
step.
Table 4. Workflow from
the AND-join step. Workflow from the AND-join step
Diagram |
Explanation |
 |
The cycle from step C back to the Split is not valid. Any
path from C must pass through the Join. |
- A path that passes through an AND-join step cannot return to that
step without first passing through the corresponding AND-split step.
Table 5. Returning to the AND-split
step. Returning to the AND-split step
Diagram |
Explanation |
 |
The cycle from step D to the Join is not valid. To create
a valid cycle, the path must first pass through the Split. |
- All paths that pass through an AND-join step must first pass through
the corresponding AND-split step.
Table 6. Passing through the corresponding AND-split step. Passing
through the corresponding AND-split step
Diagram |
Explanation |
 |
The path from step D is not valid because it did not first
pass through the Split. |