Description
Plant an unreachable state or nonterminal trap in a supplied workflow graph and retain start reachability and terminal-completion labels.
A workflow or scheduling fixture makes ordering, dependencies, capacity, and timing explicit. Returning both the constructed records and their checks helps consumers distinguish a valid arrangement from a simulated failure case.
Plant an unreachable state or nonterminal trap in a supplied workflow graph and retain start reachability and terminal-completion labels.
When to use this tool
Use this generator to create reproducible workflow dead end fixture cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.
How to use the tool and how it works
- Supply states, transitions, start, terminals, mode in the field shapes below. Set seed when you need an explicit replay.
- Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
- Read plantedState, graph, reachable, unreachable, cannotComplete, terminalTraps. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Choose an eligible non-start state and either remove all incoming edges to plant an unreachable state or remove its outgoing edges to plant a reachable nonterminal trap. Recompute start reachability and reverse reachability from supplied terminals to report unreachable, cannot-complete and terminal-trap labels.1
Delegated operations used for this result: breadth first traversal. Their calculation or parsing conventions apply to the corresponding result fields.2
| Input field | Meaning and units | Accepted input |
|---|---|---|
| states | States | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 128.; minimum items 2; maximum items 16. |
| transitions | Transitions | Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64. |
| transitions[].from | From | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| transitions[].to | To | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| start | Start | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| terminals | Terminals | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 128.; minimum items 1; maximum items 16. |
| mode | Mode | Required. Text; one of "trap", "unreachable". |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| plantedState | Planted State | Required. Text; maximum UTF-16 length 65536. |
| graph | Graph | Required. Object. |
| reachable | Reachable | Required. Array of Text; maximum UTF-16 length 65536.; minimum items 0; maximum items 16. |
| unreachable | Unreachable | Required. Array of Text; maximum UTF-16 length 65536.; minimum items 0; maximum items 16. |
| cannotComplete | Cannot Complete | Required. Array of Text; maximum UTF-16 length 65536.; minimum items 0; maximum items 16. |
| terminalTraps | Terminal Traps | Required. Array of Text; maximum UTF-16 length 65536.; minimum items 0; maximum items 16. |
| randomness | Replay metadata: source is seed or context; seed is the normalized 32-bit seed or null for a context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional numeric replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. Text; one of "context", "seed". |
An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.
{
"input": {
"states": [
"a",
"b",
"done"
],
"transitions": [
{
"from": "a",
"to": "b"
},
{
"from": "b",
"to": "done"
}
],
"start": "a",
"terminals": [
"done"
],
"mode": "trap",
"seed": 42
},
"output": {
"plantedState": "b",
"graph": {
"a": [
"b"
],
"b": [],
"done": []
},
"reachable": [
"a",
"b"
],
"unreachable": [
"done"
],
"cannotComplete": [
"a",
"b"
],
"terminalTraps": [
"b"
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- Terminal status is caller-declared. The result diagnoses the mutated finite graph and does not execute a workflow or prove that a sampled operational path is safe.
- A replay requires the same complete input and implementation. Randomized construction does not guarantee uniform coverage of every feasible output; finite samples can repeat unless a distinct-selection rule is explicitly stated.
- The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.
Alternative or Complementary methods
For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.
References
Similar or alternative tools
- Random Workflow Audit Trail Dataset Generator
Walk a supplied workflow graph for an exact event count with monotonic synthetic timestamps, actors, state frequencies, and a separately labeled invalid transition.
- Random Workflow Loop Budget Fixture Generator
Walk supplied transitions with an explicit per-state visit budget, retaining the first violation or terminal/step-limit stop and whole-graph cycle status.