Related papers: Colored Petri Nets are Monoidal Double Functors
Let $T$ be an unrooted tree. The \emph{chromatic symmetric function} $X_T$, introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of $T$. The \emph{subtree polynomial} $S_T$, first considered…
Webs are combinatorial diagrams used to encode homomorphisms between representations of Lie (super)algebras and related objects. This paper extends the theory of webs to the quantum group of type Q. We define a monoidal supercategory of…
We show that a functor category whose domain is a colored category is a topos.The topos structure enables us to introduce cohomology of colored categories including quasi-schemoids. If the given colored category arises from an association…
Database administrators need to compute closure of functional dependencies (FDs) for normalization of database systems and enforcing integrity rules. Colored Petri net (CPN) is a powerful formal method for modelling and verification of…
We construct an equivalence between the 2-categories VMonCat of rigid V-monoidal categories for a braided monoidal category V and VModTens of oplax braided functors from V into the Drinfeld centers of ordinary rigid monoidal categories. The…
Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…
Reversing Petri nets (RPNs) have recently been proposed as a net-basedapproach to model causal and out-of-causal order reversibility. They are based on the notion of individual tokens that can be connected together via bonds. In this paper…
We present an embedding of Petri nets into B abstract systems. The embedding is achieved by translating both the static structure (modelling aspect) and the evolution semantics of Petri nets. The static structure of a Petri-net is captured…
We define a notion of category enriched over an oplax monoidal category $V$, extending the usual definition of category enriched over a monoidal category. Even though oplax monoidal structures involve infinitely many functors $V^n\to V$,…
New subclasses of Petri nets - Petri nets receptors and Petri nets effectors are introduced. The introduction/exclusion of such substructures in the main Petri net may be fulfilled in accordance with the Fusion/Defusion principles. We…
In this paper, we state and prove precise theorems on the classification of the category of (braided) categorical groups and their (braided) monoidal functors, and some applications obtained from the basic studies on monoidal functors…
We use the framework of "props" to study electrical circuits, signal-flow diagrams, and bond graphs. A prop is a strict symmetric monoidal category where the objects are natural numbers, with the tensor product of objects given by addition.…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
One aim of this paper is to develop some aspects of the theory of monoidal derivators. The passages from categories and model categories to derivators both respect monoidal objects and hence give rise to natural examples. We also introduce…
Motivated by the challenge of defining twisted quantum field theories in the context of higher categories, we develop a general framework for lax and oplax transformations and their higher analogs between strong $(\infty, n)$-functors. We…
Generalizing the approach to pseudo monoidal DG-categories as certain colored non-symmetric DG-operads, we introduce a certain relaxed notion of a category enriched in DG-categories. We construct model structures on the category of colored…
We develop and extend the theory of Mackey functors as an application of enriched category theory. We define Mackey functors on a lextensive category $\E$ and investigate the properties of the category of Mackey functors on $\E$. We show…
The theory of 2-monads entails that, for a strict monoidal category C, there is a strict monoidal category L(C) such that strict monoidal functors from L(C) are precisely the lax monoidal functors from C. We give an elementary,…
Developing algorithms for distributed systems is an error-prone task. Formal models like Petri nets with transits and Petri games can prevent errors when developing such algorithms. Petri nets with transits allow us to follow the data flow…
We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…