-
Symmetric Monoidal Categories: The Structure Underneath
Petri nets are morphisms in a symmetric monoidal category. This isn't an analogy — it's the theorem that explains why composition, analysis, and proofs all work the way they do.
-
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.