arXiv subjects

Sophie Libkind

Publications and source records attributed to Sophie Libkind.

11 recordsLinked to original sources

arXiv2026

Dependent Directed Wiring Diagrams for Composing Instantaneous Systems

Directed wiring diagrams can be used as a composition pattern for composing input/output systems such as Moore machines. In a Moore machine, the input parametrizes an internal state and the internal state defines the output. Because the value of the output is shielded from the input by the internal state, Moore machines can compose by connecting the output of any machine to the input of any other machine. These connections are defined by the trace wires in a directed wiring diagram. Unlike Moore machines, Mealy machines allow the output to be directly and instantaneously affected by the input. In order to compose such machines via directed wiring diagrams, it is necessary to avoid cycles between trace wires in the wiring digram and dependencies of outputs on inputs. To capture these patterns of composition, we introduce an operad of dependent directed wiring diagrams. We then define an algebra of Mealy machines on this operad and an algebra of stock and flow diagrams in which the values of auxiliary variables are parameterized by inputs. Finally, we give a semantics for this algebra of stock and flow diagrams by giving a morphism of algebras from stock and flow diagrams into Mealy machines.

math.CT↗

arXiv2025

Comparing loose bimodules and double barrels using pseudo-models of enhanced sketches

(Pseudo) double categories have two sorts of morphisms: tight ones which compose strictly, and loose ones which compose up to coherent isomorphism. In this paper, we consider bimodules between double categories in the loose direction. We provide two formulation of this concept -- first as pseudo-bimodules between pseudo-categories in the 2-category of categories, and second as double barrels generalizing Joyal's definition of bimodules between categories as functors into the walking arrow -- and prove these two formulations equivalent. In order to prove this equivalence, we define a notion of \emph{pseudo-model} of an enhanced sketch, which may be of independent interest. We then consider some double category theory unlocked by the theory of loose bimodules: loose adjunctions, and loose limits.

math.CT↗

arXiv2025

Pattern Runs on Matter: The Free Monad Monad as a Module over the Cofree Comonad Comonad

Interviews run on people, programs run on operating systems, voting schemes run on voters, games run on players. Each of these is an example of the abstraction pattern runs on matter. Pattern determines the decision tree that governs how a situation can unfold, while matter responds with decisions at each juncture. In this article, we will give a straightforward and concrete construction of the free monad monad for the category of polynomial functors with the substitution monoidal product. Although the free monad has been well-studied in other contexts, the construction we give is streamlined and explicitly illustrates how the free monad represents terminating decision trees. We will also explore the naturally arising interaction between the free monad and cofree comonad. Again, while the interaction itself is known, the perspective we take is the free monad as a module over the cofree comonad. Lastly, we will give four applications of the module action to interviews, computer programs, voting, and games. In each example, we will see how the free monad represents pattern, the cofree comonad represents matter, and the module action represents runs on.

math.CT↗

arXiv2025

Additive Invariants of Open Petri Nets

We classify all additive invariants of open Petri nets: these are $\mathbb{N}$-valued invariants which are additive with respect to sequential and parallel composition of open Petri nets. In particular, we prove two classification theorems: one for open Petri nets and one for monically open Petri nets (i.e. open Petri nets whose interfaces are specified by monic maps). Our results can be summarized as follows. The additive invariants of open Petri nets are completely determined by their values on a particular class of single-transition Petri nets. However, for monically open Petri nets, the additive invariants are determined by their values on transitionless Petri nets and all single-transition Petri nets. Our results confirm a conjecture of John Baez (stated during the AMS' 2022 Mathematical Research Communities workshop).

math.CT↗

arXiv2025

Towards a double operadic theory of systems

We present a unified framework for categorical systems theory which packages a collection of open systems, their interactions, and their maps into a symmetric monoidal loose right module of systems over a symmetric monoidal double category of interfaces and interactions. As examples, we give detailed descriptions of (1) the module of open Petri nets over undirected wiring diagrams and (2) the module of deterministic Moore machines over lenses. We define several pseudo-functorial constructions of modules of systems in the form of doctrines of systems theories. In particular, we introduce doctrines for port-plugging systems, variable sharing systems, and generalized Moore machines, each of which generalizes existing work in categorical systems theory. Finally, we observe how diagrammatic interaction patterns are free processes in particular doctrines.

math.CT↗

arXiv2024

Dynamic task delegation for hierarchical agents

This is the fourth installment in a series of papers offering models of hierarchical structure for dynamical systems, using the language of polynomial functors. The operad underlying the symmetric monoidal category $(\mathbf{Poly}, \otimes, \mathcal{y})$ can be viewed as defining the behavior of hierarchical delegation. In particular, a morphism $\mathbf{Poly}(p_1 \otimes \cdots \otimes p_m, q)$ turns the outputs of subordinates with interfaces $p_i$ into the output of an agent with interface $q$ and turns a task given to the agent into a task for each of the subordinates. In this article, we extend the framework so that subordinates may be invoked asynchronously depending on the outcomes of other subordinates. We prove that the free (co)monad (co)monad extends to a (co)monad on $\mathbf{Org}$. From the perspective of programs/pattern, this extension implies the existence of a $\mathbf{Cat}$-enriched operad $\mathbf{Org}_\mathfrak{m}$, and from the perspective of behavior/matter, it implies the existence of a $\mathbf{Cat}$-enriched operad $\mathbf{Org}^\mathfrak{c}$. Second, we crispen the relationship between the programmatic and behavioral perspectives via a functor $[-, t] \colon \mathbf{Org}_{\mathfrak{m}}^\textrm{op} \to \mathbf{Org}^\mathfrak{c}$ for any polynomial monad $t$.

math.CT↗

arXiv2023

Compositional Modeling with Stock and Flow Diagrams

Stock and flow diagrams are widely used in epidemiology to model the dynamics of populations. Although tools already exist for building these diagrams and simulating the systems they describe, we have created a new package called StockFlow, part of the AlgebraicJulia ecosystem, which uses ideas from category theory to overcome notable limitations of existing software. Compositionality is provided by the theory of decorated cospans: stock and flow diagrams can be composed to form larger ones in an intuitive way formalized by the operad of undirected wiring diagrams. Our approach also cleanly separates the syntax of stock and flow diagrams from the semantics they can be assigned. We consider semantics in ordinary differential equations, although others are possible. As an example, we explain code in StockFlow that implements a simplified version of a COVID-19 model used in Canada.

cs.LO↗

arXiv2023

A Categorical Framework for Modeling with Stock and Flow Diagrams

Stock and flow diagrams are already an important tool in epidemiology, but category theory lets us go further and treat these diagrams as mathematical entities in their own right. In this chapter we use communicable disease models created with our software, StockFlow.jl, to explain the benefits of the categorical approach. We first explain the category of stock-flow diagrams and note the clear separation between the syntax of these diagrams and their semantics, demonstrating three examples of semantics already implemented in the software: ODEs, causal loop diagrams, and system structure diagrams. We then turn to two methods for building large stock-flow diagrams from smaller ones in a modular fashion: composition and stratification. Finally, we introduce the open-source ModelCollab software for diagram-based collaborative modeling. The graphical user interface of this web-based software lets modelers take advantage of the ideas discussed here without any knowledge of their categorical foundations.

cs.LO↗

arXiv2022

Operadic Modeling of Dynamical Systems: Mathematics and Computation

Dynamical systems are ubiquitous in science and engineering as models of phenomena that evolve over time. Although complex dynamical systems tend to have important modular structure, conventional modeling approaches suppress this structure. Building on recent work in applied category theory, we show how deterministic dynamical systems, discrete and continuous, can be composed in a hierarchical style. In mathematical terms, we reformulate some existing operads of wiring diagrams and introduce new ones, using the general formalism of C-sets (copresheaves). We then establish dynamical systems as algebras of these operads. In a computational vein, we show that Euler's method is functorial for undirected systems, extending a previous result for directed systems. All of the ideas in this paper are implemented as practical software using Catlab and the AlgebraicJulia ecosystem, written in the Julia programming language for scientific computing.

math.CT↗

arXiv2022

An Algebraic Framework for Structured Epidemic Modeling

Pandemic management requires that scientists rapidly formulate and analyze epidemiological models in order to forecast the spread of disease and the effects of mitigation strategies. Scientists must modify existing models and create novel ones in light of new biological data and policy changes such as social distancing and vaccination. Traditional scientific modeling workflows detach the structure of a model -- its submodels and their interactions -- from its implementation in software. Consequently, incorporating local changes to model components may require global edits to the code-base through a manual, time-intensive, and error-prone process. We propose a compositional modeling framework that uses high-level algebraic structures to capture domain-specific scientific knowledge and bridge the gap between how scientists think about models and the code that implements them. These algebraic structures, grounded in applied category theory, simplify and expedite modeling tasks such as model specification, stratification, analysis, and calibration. With their structure made explicit, models also become easier to communicate, criticize, and refine in light of stakeholder feedback.

cs.PL↗

arXiv2020

An Algebra of Resource Sharing Machines

Dynamical systems are a broad class of mathematical tools used to describe the evolution of physical and computational processes. Traditionally these processes model changing entities in a static world. Picture a ball rolling on an empty table. In contrast, open dynamical systems model changing entities in a changing world. Picture a ball in an ongoing game of billiards. In the literature, there is ambiguity about the interpretation of the "open" in open dynamical systems. In other words, there is ambiguity in the mechanism by which open dynamical systems interact. To some, open dynamical systems are input-output machines which interact by feeding the input of one system with the output of another. To others, open dynamical systems are input-output agnostic and interact through a shared pool of resources. In this paper, we define an algebra of open dynamical systems which unifies these two perspectives. We consider in detail two concrete instances of dynamical systems -- continuous flows on manifolds and non-deterministic automata.

math.CT↗