State-machine tester
Step through events in a deterministic state machine and generate shortest transition test sequences.
What it does
Step through events in a deterministic state machine and generate shortest transition test sequences.
How to use it
- Define initial state, states and from/event/to transitions as JSON; analyse, step events and export traces.
- Processing stays in your browser. No upload or sign-up.
Example
The draft → submit → review → approve → published workflow produces a two-event shortest path to published.
Methodology
Breadth-first search from the initial state finds reachable states and shortest event sequences. Each reachable transition receives a test sequence starting from reset; interactive steps follow declared transitions only.
Limitations
100 states, 500 transitions, 100,000 JSON characters, depth 30, names up to 80 characters and 500 trace steps. Flat deterministic machines only. Unknown states, duplicate state/event pairs, actions and guards are rejected. No code execution or control of real applications; tests do not cover every possible path.
Automation
This tool runs in your browser. No upload API or MCP endpoint is available.
View capabilities and documentationReference updated
Join the conversation
Helpful tips, questions, and ideas for making this tool better.
Loading discussion…