-
A Tiling for Computation
A small, fixed alphabet whose local composition rules generate checkable systems in domains that share nothing else — token standards, business operations, games, music, our own infrastructure — and how much of that claim has code behind it: a composed help-desk model under test, and one coffee-machine net held to a golden trace across thirty-nine programs.
-
The Little Language Thesis
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.
-
Symmetric Monoidal Categories: The Structure Underneath
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.
-
Categorical Net Types
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.