Description
Walk a supplied workflow graph for an exact event count with monotonic synthetic timestamps, actors, state frequencies, and a separately labeled invalid transition.
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.
Walk a supplied workflow graph for an exact event count with monotonic synthetic timestamps, actors, state frequencies, and a separately labeled invalid transition.
When to use this tool
Use this generator to create reproducible workflow audit trail dataset 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, initialState, actorIds, count, startMilliseconds, endMilliseconds, includeInvalidControl 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 events, finalState, stateFrequencies, controls. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Precompute which states can finish an exact-length walk, reserving a final state with an absent transition when an invalid control is requested. Draw only viable next states, actors and nondecreasing millisecond timestamps, then report destination frequencies and a separately labeled invalid transition.1
| 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 1; maximum items 32. |
| transitions | Transitions | Required. Array of Object; no unknown keys.; minimum items 0; maximum items 1024. |
| 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. |
| initialState | Initial State | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| actorIds | Actor Ids | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 128.; minimum items 1; maximum items 128. |
| count | Requested count; the mechanics explain whether one draw expands into several returned records. | Required. Safe integer; minimum 1; maximum 128. |
| startMilliseconds | Start Milliseconds | Required. Safe integer. |
| endMilliseconds | End Milliseconds | Required. Safe integer. |
| includeInvalidControl | Include Invalid Control | Required. Boolean. |
| 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 |
|---|---|---|
| events | Events | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 128. |
| events[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| events[].from | From | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| events[].to | To | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| events[].actorId | Actor Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| events[].timestampMilliseconds | Timestamp Milliseconds | Required. Safe integer. |
| finalState | Final State | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| stateFrequencies | State Frequencies | Required. Array of Object; no unknown keys.; minimum items 0; maximum items 32. |
| stateFrequencies[].label | Caller-facing text label; not a globally unique identifier. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| stateFrequencies[].count | Requested count; the mechanics explain whether one draw expands into several returned records. | Required. Safe integer. |
| controls | Controls | Required. Array of Object; no unknown keys.; minimum items 0; maximum items 1. |
| controls[].from | From | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| controls[].to | To | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| controls[].validTransition | Valid Transition | Required. Boolean. |
| 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": [
"draft",
"review",
"done"
],
"transitions": [
{
"from": "draft",
"to": "review"
},
{
"from": "review",
"to": "done"
}
],
"initialState": "draft",
"actorIds": [
"actor-a",
"actor-b"
],
"count": 2,
"startMilliseconds": 1000,
"endMilliseconds": 2000,
"includeInvalidControl": true,
"seed": 42
},
"output": {
"events": [
{
"id": "event-1",
"from": "draft",
"to": "review",
"actorId": "actor-a",
"timestampMilliseconds": 1853
},
{
"id": "event-2",
"from": "review",
"to": "done",
"actorId": "actor-a",
"timestampMilliseconds": 1930
}
],
"finalState": "done",
"stateFrequencies": [
{
"label": "review",
"count": 1
},
{
"label": "done",
"count": 1
}
],
"controls": [
{
"from": "done",
"to": "draft",
"validTransition": false
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
} Limitations and assumptions
- Synthetic timestamps may tie. State frequencies count event destinations rather than an extra initial visit. Infeasible exact lengths or unavailable invalid controls are rejected; no real audit log is collected.
- 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 Dead-End Fixture Generator
Plant an unreachable state or nonterminal trap in a supplied workflow graph and retain start reachability and terminal-completion labels.
- 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.