Four places and three mass-action transitions generate the ODE system that Michaelis-Menten is derived from. What the retired demo integrated, what it read off a formula, and the saturation sweep nothing runs yet.
Power-of-2 weights encode lexicographic order over distinct ranks as a single integer. We tried it for poker kicker scoring inside the net and reverted it; the per-card variant we shipped also broke the ordering. Where the encoding belongs, and where it doesn't.
How gnark circuits prove that a Petri net transition is valid without revealing the state—MiMC hashing, topology-based constraints, and Groth16 proofs.
Five Petri net types classify token behavior — workflow cursors, countable resources, game turns, continuous rates, and classification signals — with typed links that constrain how nets compose.
Resource modeling with Petri nets — the five-drink core of go-pflow's coffee shop, where arc weights are recipes, each ingredient carries a conservation law, and the rates say what runs out first (milk, not cups). Revised to link the code, restore mocha's syrup and label every minute figure as a linear estimate.
A tour of sim.pflow.xyz — a catalog of executable Petri-net models you can run, compare and check, from tic-tac-toe to a café to a vet clinic, in the browser or from any MCP client.
The five-seat Hold'em tutorial net (18 places, 32 transitions) read against its source — phase places, turn tokens, a dealer role and an event log, plus what the net leaves to code (chips, guards, re-raises) and one bug in how seats re-enter a hand.
The gnark circuits behind ZK tic-tac-toe, read against the code — a board circuit and a 33-place Petri-net circuit, what each proves, what stays public, and what the constraint count comes to.
A minimal blog platform with ActivityPub federation. Markdown files, a Go binary, two JSON files and a PEM key for federation state. No database.
Four terms — cell, func, arrow, guard — generate a free symmetric monoidal category. The DSL is a categorical language for executable token models.
A 4×4 Sudoku as a Petri net in the tic-tac-toe pattern — cells, digit moves with history, constraint collectors into a solved place — checked against the go-pflow generator, which shows the collectors as built can never fire and the ODE ranking is not yet demonstrated.
Tic-tac-toe as a Petri net scored by ODE simulation — the plain flow recovers the 4 : 3 : 2 line-count prior but misses forks; declaring the opponent's forced replies as structure makes the evaluator minimax-equivalent.
Reflecting on old ideas with new tools — from Petri nets to proofs, from Bash scripts to composable universes.
Introducing Stackdump Blog
A modeling approach where system behavior is described declaratively and encoded directly in differential equations.
A four-item 0/1 knapsack as a Petri net under mass-action ODEs — why every item stops at 71.4%, what exclusion analysis actually ranks, and where the relaxation falls short of branch-and-bound.
A poem for Carl Adam Petri, inventor of Petri nets—the mathematical notation for concurrent systems.