Related papers: A Categorical Semantics for Guarded Petri Nets
We give a definition of an operad with general groups of equivariance suitable for use in any symmetric monoidal category with appropriate colimits. We then apply this notion to study the 2-category of algebras over an operad in Cat. We…
We introduce string diagrams for graded symmetric monoidal categories. Our approach includes a definition of graded monoidal theory and the corresponding freely generated syntactic category. Also, we show how an axiomatic presentation for…
We investigate monoidal categories of formal contexts, in which states correspond to formal concepts. In particular we examine the category of bonds or Chu correspondences between contexts, which is known to be equivalent to the…
We provide a categorical framework for mathematical objects for which there is both a sort of "independent" and "dependent" composition. Namely we model them as duoidal categories in which both monoidal structures share a unit and the first…
We define push-forwards for Witt groups of schemes along proper morphisms, using Grothendieck duality theory. This article is an application of results of the authors on tensor-triangulated closed categories to such structures on some…
We give a description of unital operads in a symmetric monoidal category as monoids in a monoidal category of unital $\Lambda$-sequences. This is a new variant of Kelly's old description of operads as monoids in the monoidal category of…
We give a general construction of categorical idempotents which recovers the categorified Jones-Wenzl projectors, categorified Young symmetrizers, and other constructions as special cases. The construction is intimately tied to cell theory…
The Grothendieck monoid of an exact category is a monoid version of the Grothendieck group. We use it to classify Serre subcategories of an exact category and to reconstruct the topology of a noetherian scheme. We first construct bijections…
Recently introduced Petri net-based formalisms advocate the importance of proper representation and management of case objects as well as their co-evolution. In this work we build on top of one of such formalisms and introduce the notion of…
In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…
Systematically discovering semantic relationships in text is an important and extensively studied area in Natural Language Processing, with various tasks such as entailment, semantic similarity, etc. Decomposability of sentence-level scores…
In this paper,the authors show the versatility of the Signed Petri Net (SPN) introduced by them by showing the equivalence between a Logic Signed Petri Net (LSPN) and Logic Petri Net (LPN).The capacity of each place in all these nets is at…
Let $n$ be a product of two distinct prime numbers. We construct a triangulated monoidal category having a Grothendieck ring isomorphic to the ring of $n$:th cyclotomic integers.
We propose a recursive definition of V-n-categories and their morphisms. We show that for V k-fold monoidal the structure of a (k-n)-fold monoidal strict (n+1)-category is possessed by V-n-Cat. This article is a completion of the work begun…
We present Trimble's definition of a tetracategory and prove that the spans in (strict) 2-categories with certain limits have the structure of a monoidal tricategory, defined as a one-object tetracategory. We recall some notions of limits…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
Parametric time Petri nets with inhibitor arcs (PITPNs) support flexibility for timed systems by allowing parameters in firing bounds. In this paper we present and prove correct a concrete and a symbolic rewriting logic semantics for…
Petri Nets (PN) are extensively used as a robust formalism to model concurrent and distributed systems; however, they encounter difficulties in accurately modeling adaptive systems. To address this issue, we defined rewritable PT nets…
We construct a monoidal version of Lurie's un/straightening equivalence. In more detail, for any symmetric monoidal $\infty$-category $\mathbf C$, we endow the $\infty$-category of coCartesian fibrations over $\mathbf C$ with a (naturally…
We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured…