One section in, one section out — on Markdown/GEML files, bad writes refused.
- Passed: Handshake
- Passed: Tools listed
- Passed: Updated recently
Median latency 70 ms · Last checked
Explore
Evidence for your next connection.
Independent measurements of remote MCP servers. Every observation has a timestamp.
Read-only probesMCP server · File & docs
Turn a few lines of text into a UML state machine diagram document, and check the machine.
2 failed · 8 not measured
Median of successful probes over 7 days
Share of countable probes over 30 days, including daily rollups. Auth challenges are excluded.
Tool definitions returned by this server
Independent monitoring
Responded
The server completed its last measured handshake. This is an observation, not a guarantee.
Last checked| Test area | Passed | Failed | Unmeasured |
|---|---|---|---|
ConnectionCan a client connect and discover tools? | 5 | 0 | 0 |
Reliability & speedDoes it respond consistently and quickly? | 0 | 0 | 4 |
Access & authenticationWhat is required to use this server? | 1 | 0 | 2 |
Tool qualityAre the tool definitions usable by an agent? | 4 | 0 | 0 |
Publisher identityCan the publisher be traced to its source? | 2 | 2 | 2 |
Unmeasured means there is not enough evidence to decide. How these checks work
Start using Zovo State Diagram
Choose your client, copy the configuration, then enable the server in your client’s MCP settings.
Run this command in your terminal, then restart Claude Code.
Claude Code
claude mcp add --transport http zovo-state-diagram https://state-diagram.zovo.one/mcpCapabilities
Use this when the user wants state machine text checked without a drawing, for example "which states are unreachable?" or "check my state diagram for dead ends". Takes the same diagram text as make_state_diagram. Returns ready true or false; when a line breaks the grammar, the line number, the token and the reason; otherwise the states with incoming and outgoing transition counts, states not reachable from the start, states with no path to the end (both by breadth-first search; a composite state is entered through its own start), and transitions that leave the same state on the same event and guard. Does not draw the diagram or make files, and does not read fork, join, history or concurrent regions.
DiscoveredUse this when the user wants a UML state diagram or state machine drawn, for example "draw the states of an order" or "make a PDF of this state machine". Takes the diagram text in a line grammar: state Name / state "Long label" as Name / state Name <<choice>> / state Name { ... } (composite, nest up to 3); [*] -> A (start), A -> [*] (end); A -> B: event [guard] / action; A -> A: event (self); note A: text; # comments. When the user describes the machine in words, write it in this grammar first. Returns counts, states, transitions in input order, the machine check (unreachable states, states with no path to the end, non-deterministic transitions), a check on the drawing, the PDF page count, an interactive diagram, and PDF, SVG and CSV downloads. Refuses a line outside the grammar with its line number and token. Up to 80 states and 300 transitions. Does not read fork, join, history or concurrent regions. Download links of large diagrams expire after about 1 hour.
DiscoveredRecent measurements
| Checked | Result | Response | Tools |
|---|---|---|---|
| Connected | 101 ms | 2 |