The reachability semantics for Petri nets can be studied using open Petri nets. For us, an
“open” Petri net is one with certain places designated as inputs and outputs via a cospan of …

Fong has developed a compositional framework by the name of\emph {decorated cospans}
that is well-suited for modelingopen'networks and systems. In this framework, open networks …

We introduce monoidal width as a measure of complexity for morphisms in monoidal
categories. Inspired by well-known structural width measures for graphs, like tree width and …

Coarse-graining is a standard method of extracting a simple Markov process from a more
complicated one by identifying states. Here we extend coarse-graining to open Markov …

This thesis aims to develop a compositional theory for the operational semantics of
networks. The networks considered are described by either internal or enriched graphs. In …

Bisimulation is a concept that captures behavioural equivalence of states in a transition
system. It has been widely studied in discrete time. In this work, I have first suggested a …

Baez, John C. ; Courser, Kenny Coarse-graining open Markov processes. (English) £ ¢ ¡ Zbl
1406.18004 Theory Appl. Categ. 33, Page 1 Baez, John C.; Courser, Kenny Coarse-graining …

Baez, John C. ; Master, Jade Open Petri nets. (English) £ ¢ ¡ Zbl 07283037 Math. Struct.
Comput. Sci. 30, No. 3, 314-341 (20 Page 1 Baez, John C.; Master, Jade Open Petri nets. (English) …

The goal of this thesis is to show that a wide range of operational systems can be reasoned
about compositionally. The formal tool we use to explore this is the notion of a bicategory …