Related papers: Colored Petri Nets are Monoidal Double Functors
We define a generalization of (coloured) operads based on double lax functors and we construct a model structure on the associated category of generalized simplicial (coloured) operads. In particular, we obtain a model structure on the…
A marked Petri net is lucent if there are no two different reachable markings enabling the same set of transitions, i.e., states are fully characterized by the transitions they enable. Characterizing the class of systems that are lucent is…
We extend the arithmetic product of species of structures and symmetric sequences studied by Maia and Mendez and by Dwyer and Hess to coloured symmetric sequences and show that it determines a normal oplax monoidal structure on the…
We provide a calculus of mates for functors to the $\infty$-category of $\infty$-categories and extend Lurie's unstraightening equivalences to show that (op)lax natural transformations correspond to maps of (co)cartesian fibrations that do…
Regulatory networks depict promoting or inhibiting interactions between molecules in a biochemical system. We introduce a category-theoretic formalism for regulatory networks, using signed graphs to model the networks and signed functors to…
We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…
In this contribution we extend the concept of a Petri net morphism to Elementary Object Systems (EOS). EOS are a nets-within-nets formalism, i.e. we allow the tokens of a Petri net to be Petri nets again. This nested structure has the…
Let $R$ be a commutative ring with unit. We develop a Hochschild cohomology theory in the category $\mathcal{F}$ of linear functors defined from an essentially small symmetric monoidal category enriched in $R$-Mod, to $R$-Mod. The category…
We introduce a tensor product for symmetric monoidal categories with the following properties. Let SMC denote the 2-category with objects small symmetric monoidal categories, arrows symmetric monoidal functors and 2-cells monoidal natural…
The chromatic functor of a simple graph is a functorization of the chromatic polynomial. M. Yoshinaga showed in \cite{Yoshinaga2015} that two finite graphs have isomorphic chromatic functors if and only if they have the same chromatic…
Brown and Gurr have introduced a model of Petri Nets that is based on de~Paiva's Dialectica categories. This model was refined in an unpublished technical report, where Petri nets with multiplicities, instead of {\em elementary} nets (i.e.,…
This paper explores the problem of determining which classes of Petri nets can be encoded into behaviourally-equivalent CCS processes. Most of the existing related literature focuses on the inverse problem (i.e., encoding process calculi…
Reversible computation is an emerging computing paradigm that allows any sequence of operations to be executed in reverse order at any point during computation. Its appeal lies in its potential for lowpower computation and its relevance to…
This paper introduces type P web supercategories. They are defined as diagrammatic monoidal $k$-linear supercategories via generators and relations. We study the structure of these categories and provide diagrammatic bases for their…
We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks. They can be seen as Petri nets where tokens (representing…
We develop the theory of (op)fibrations of 2-multicategories and use it to define abstract six-functor-formalisms. We also give axioms for Wirthm\"uller and Grothendieck formalisms (where either $f^!=f^*$ or $f_!=f_*$) or intermediate…
Step net bisimilarity \cite{Gor23} is a truly concurrent behavioral equivalence for finite Petri nets, which is defined as a smooth generalization of standard step bisimilarity \cite{NT84} on Petri nets, but with the property of relating…
The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…
We arrange morphisms and comorphisms of sites as the horizontal and vertical cells of a double category of sites; using the formalism of extensions and restrictions of presheaves, we explains how one can define a sheafification double…
In this paper, we consider categories with colored morphisms and functors such that morphisms assigned to morphisms with a common color have a common color. In this paper, we construct a morphism-colored functor such that any…