Execution state is a zipper — the present moment is not a parameter or a modality but a universe that separates tropical past from predicate future. Tic-tac-toe makes the structure visible.
cell, func, arrow, guard are the structural primitives — but the real ubiquitous language lives in the labels. Like Forth, we build up domain vocabularies on a minimal substrate, and the incidence matrix proves what it can see: conservation, not guards or data.
A music sequencer built entirely on Petri nets — token rings become drum machines, Euclidean rhythms fall out of the topology, and polyrhythm comes free.
Anonymous polls in bitwrap-io: a small Petri net whose cast-vote transition carries a Groth16 proof of registry membership, nullifier and range — and what the current code does about secrecy after the poll closes.
From OP_RETURN in 2014 to zero-knowledge Petri nets in 2026 — bitwrap compiles one Petri-net schema into Groth16 circuits, a Solidity contract with Foundry tests, and a content-addressed model, and this post links the code for each and says where the generated outputs still disagree.
Three NCAA tournament Petri nets, each solved by ODE and by Monte Carlo, suggest a two-axis rule (coupling × token count) for when the two agree. On the bracket net an exact forward propagation over the matchups replaces 150,000 simulated games with 256 configurations, though the code reads the bracket's game list rather than its incidence matrix.
Settlement networks form a sub-SMC of open Petri nets. The core-observer split is really two boundaries — an algebraic one (ρ) inside the incidence matrix and a categorical one (contextual arcs) outside it — and a ZK circuit dissolves only the second.
ODE simulation, tropical analysis and zero-knowledge proofs each draw a line between a Petri net's core and its observer. Where the three agree on tic-tac-toe, why the agreement follows from one definition, and where the code does not yet match the theorem.
Timed event graphs are max-plus linear and ReLU networks are tropical rational, so the two meet over the tropical semiring. This post covers what those two theorems give us, what pflow-tropical checks in code, and how far the Petri-net/neural-net analogy has actually been earned.
A Petri net generates a free symmetric monoidal category — places give the objects, transitions the generating morphisms. What that theorem buys for composition, analysis and proofs across this blog, and which of the connections are still a shape match rather than a checked result.
Describe your business to an LLM, get a simulation you can actually play with — adjust staffing, change demand, and watch the numbers move. Revised to say which vet-clinic results the tests actually check, and that the coffee shop runs out of milk, not cups.
Why executable formal models matter more with LLMs around, not less — and what the LLM is and isn't trusted with when a Petri net constrains it.
Paste source code in any language and Claude returns a Petri net that a validator checks for structure and deadlocks — what is checked, what isn't, and the faithfulness test not yet run.
A draft paper formalizing incidence reduction — the ODE equilibrium of an analysis net is exactly the reciprocal of each entity's constraint count — checked on tic-tac-toe, poker, Connect Four, and Hex, with the tests linked.
Incidence reduction applied to poker in one pflow-rs example — hand-category values come out of the ODE as 1/drains over hand-picked drain counts, every game action is Groth16-proven, the shuffle is a Poseidon commit-reveal, and the generated contract still trusts the showdown.
With uniform rates, the tic-tac-toe ODE ranks cells by incidence degree — the number of win lines through each one — approximately on the game net and exactly on the decoupled analysis net. The go-pflow and pflow-rs tests are linked, and the rate-recovery procedure is marked as not yet built.
The same math with different labels still produces the same ODE solution. In tic-tac-toe, we see it directly — each board position is a place, and the heatmap is the solution projected onto the grid.
The blog's models, concepts, and toolchain have been organized into a book-length guide at book.pflow.xyz.
How pflow.xyz, schema.org and ActivityStreams documents share one envelope — what declarative data buys the readers, what monotonic schema growth does and does not protect, and why a CID only means something under a pinned context.
A guest post from Claude Code on building in the pflow ecosystem — what the nets generate, what the generated ZK circuit covers and what it doesn't, and which demos actually derived their equations from the arcs.