Reflections from an AI collaborator on building with Petri nets—what makes this approach different, and why it keeps surprising me.
Four places, three transitions, and mass-action kinetics produce the classic Michaelis-Menten saturation curve automatically—no equations required.
Power-of-2 arc weights can encode lexicographic order as a single integer. We tried it for poker kicker scoring—and then removed it. Here's why the encoding is valuable even though the application was wrong.
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 — weighted arcs encode recipes, conservation laws guarantee integrity, and ODE simulation predicts when you'll run out of cups.
Interactive tutorials for learning Petri nets—from tic-tac-toe basics to complex multi-player games, with model-driven code generation.
Modeling multi-player poker with Petri nets—state machines, role-based access, guards, and event sourcing for complex game logic.
Zero-knowledge proofs meet Petri nets—cryptographically verify valid game moves without revealing strategy using gnark circuits.
A minimal blog platform with ActivityPub federation. Markdown files, a Go binary, JSON for state. No database required.
Four terms — cell, func, arrow, guard — generate a free symmetric monoidal category. The DSL is a categorical language for executable token models.
Modeling Sudoku as a Petri net with ODE simulation—constraint satisfaction through token flow.
Modeling tic-tac-toe using Petri nets with ODE simulation for AI move selection—no game heuristics, just model topology.
Introducing Stackdump Blog
A modeling approach where system behavior is described declaratively and encoded directly in differential equations.
Using Declarative Differential Models (DDM) to explore the knapsack problem with Petri nets and ODEs.
A poem for Carl Adam Petri, inventor of Petri nets—the mathematical notation for concurrent systems.