Check State Machine Reachability

State Paths examines a small directed flow that you enter yourself. List each state once, add transitions as “From -> To”, and choose the start state. The result shows reachable states, unreachable states, reachable states with no outgoing transition, and a shortest route to a selected state. A state with no outgoing transition may be an intentional finish. This checks only the map you enter; it does not verify code, guards, events, or every possible runtime behavior.

How to use State Paths

1. Write one state name per line, then write each directed transition on its own line as From -> To. Names are case-sensitive.
2. Enter a start state from the list and select Check paths. Fix any unknown names or malformed transitions shown in the error message.
3. Review the reachability table, choose a state to trace its shortest path, and copy the text report for your design or code review.