-
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.
-
Petri Nets as a Universal Abstraction — Now a Book
The blog's models, concepts, and toolchain have been organized into a book-length guide at book.pflow.xyz.
-
JSON-LD as Declarative Infrastructure
Why JSON-LD's purely declarative semantics and monotonic schema expansion make it reliable infrastructure for composable systems.
-
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.