-
March Madness Without Monte Carlo
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.
-
Paper: Incidence Reduction via Petri Net ODE Equilibrium
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.
-
The Incidence Reduction
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.
-
Comparing Nets by Their ODE Signatures
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.
-
Enzyme Kinetics: Michaelis-Menten from Three Transitions
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.
-
Coffee Shop Model
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.
-
Sudoku Petri-Net Model
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.
-
Declarative Differential Models (DDM)
A modeling approach where system behavior is described declaratively and encoded directly in differential equations.
-
Knapsack Model
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.