State machine (FSM)
Native finite state machines, and the only engine here that decides whether the machine is one. A state machine's defects are facts about reachability and determinism, and neither has pixels: two arrows leaving a state on the same event with nothing to tell them apart is a machine and a coin toss, and it draws as two perfectly ordinary arrows. The engine reports nondeterministic branching, states nothing can reach, non-final states with no way out, a machine that can never terminate, and transitions naming states that were never declared — which every tool that draws what it is handed simply omits from the figure. Every arrow the document writes is drawn, and none is drawn through a box.
In the same space
Most users come to State machine (FSM) from XState visualizer or UML state diagram tools. flowss runs this engine in the browser — no install, shareable via URL, exportable to PNG / SVG / PDF / source.
Syntax at a glance
state Idle
state Paid final
initial Idle
transition Idle -> Paid on "pay"Paste this in the Studio code pane to see State machine (FSM) render live. The full grammar is at the upstream-docs link above.
Sample templates
All 26 →Standard ecommerce order state diagram.
Simplified TCP connection state machine.
Three-phase traffic-light state cycle.
Session auth state machine.
Editorial doc state machine.
The one to copy. Every state is reachable from the declared initial state, every transition names states that exist, every fork carries a guard that distinguishes it, every non-final state has a way out, and a run can reach a final state. Retries and cancellations are ordinary cycles and the engine says nothing about them, because a loop is not a defect. Reports clean, and every one of the ten checks says what it covered.
statemachine · ← Browse all engines · Quick-start guide