Composing Behaviors of Networks

MaRDI QIDQ6368662zbMATH OpenFDO

Authors Jade Master

Publication date 26 May 2021

Mathematics Subject Classification ID

Categories of spans/cospans, relations, or partial maps (18B10) Theories (e.g., algebraic theories), structure, and semantics (18C10) Enriched categories (over closed or monoidal categories) (18D20) Internal categories and groupoids (18D40) Categories of networks and processes, compositionality (18M35) 2-categories, bicategories, double categories (18N10)

Abstract: 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 the internal case we focus on $mathsfQ$-nets, a generalization of Petri nets based on a Lawvere theory $mathsfQ$. $mathsfQ$-nets include many known variants of Petri nets including pre-nets, integer nets, elementary net systems, and bounded nets. In the enriched case we focus on graphs enriched in a quantale $R$ regarded as matrices with entries in $R$. These $R$-matrices represent distance networks, Markov processes, capacity networks, non-deterministic finite automata, simple graphs, and more. The operational semantics of $mathsfQ$-nets is constructed as an adjunction between $mathsfQ$-nets and categories internal to the category of models of $mathsfQ$. Similarly, the operational semantics of $R$-matrices is constructed as an adjunction between $R$-matrices and categories enriched in $R$. The left adjoint of this adjunction sends an $R$-matrix $M$ to the $R$-category $F_R(M)$ whose hom-objects are solutions of the algebraic path problem: a generalization of the shortest path problem to graphs weighted in $R$. For both $mathsfQ$-nets and $R$-matrices we use the theory of structured cospans to study the compositionality of the above operational semantics. For each type of network we construct a double category whose morphisms are "open networks", i.e. networks with certain vertices designated as input or output. We introduce the black-boxing of an open network, a profunctor describing the externally observable behavior of an open network. We introduce a class of open networks called "functional open networks" for which black-boxing preserves composition.

This page was built for publication: Composing Behaviors of Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6368662)