Endiagram Mcp

Brings deterministic structural analysis of concurrent systems into Claude via seven tools backed by graph theory and Petri net semantics. You hand it EN Diagram source code (a simple text format where actors, actions, and resources connect by name) and ask whether the system can deadlock, whether two systems are equivalent, if paths exist between nodes, what the conservation laws are, or how subsystems compose. Every answer references a named theorem. The `structure` tool maps shape and critical paths, `invariant` checks custom rules like "every path from X to Y passes through a guard", `live` detects siphons and unbounded cycles, and `render` outputs annotated diagrams. Runs via stdio or zero install HTTP transport at api.endiagram.com/mcp. Reach for this when designing workflows, protocols, or pipelines where race conditions and bottlenecks matter more than behavior simulation.