Related papers: A Categorical Semantics for Guarded Petri Nets
We extend the notion of the nerve of a category for a small class of crossed simplicial groups, explicitly describing them using generators and relations. We do this by first considering a generalised bar construction of a group before…
We introduce the concept of a dendroidal set. This is a generalization of the notion of a simplicial set, specially suited to the study of operads in the context of homotopy theory. We define a category of trees, which extends the category…
We define a Grothendieck ring of pairs of complex quasi-projective varieties (that is a variety and a subvariety). We describe $\lambda$-structures and a power structure on/over this ring. We show that the conjectual symmetric power of the…
We develop a categorical compositional distributional semantics for Lambek Calculus with a Relevant Modality !L*, which has a limited edition of the contraction and permutation rules. The categorical part of the semantics is a monoidal…
We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…
For the cluster category of a hereditary or a canonical algebra, equivalently for the cluster category of the hereditary category of coherent sheaves on a weighted projective line, we study the Grothendieck group with respect to an…
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…
We universally characterize the produoidal category of monoidal lenses over a monoidal category. In the same way that each category induces a cofree promonoidal category of spliced arrows, each monoidal category induces a cofree produoidal…
We extend the theory of Sweeder's measuring comonoids to the framework of duoidal categories: categories equipped with two compatible monoidal structures. We use one of the tensor products to endow the category of monoids for the other with…
We consider commutative Frobenius pseudomonoids in the bicategory of spans, and we show that they are in correspondence with 2-Segal cosymmetric sets. Such a structure can be interpreted as a coherent 2-dimensional topological quantum field…
We show that the category of (reflexive) graphs and graph maps carries exactly two closed symmetric monoidal products: the box product and the categorical product.
We prove a coherence theorem for actions of groups on monoidal categories. As an application we prove coherence for arbitrary braided $G$-crossed categories.
We construct a machine which takes as input a locally small symmetric closed complete multicategory $\mathsf V$. And its output is again a locally small symmetric closed complete multicategory $\mathsf V\text-\mathcal{C}at$, the…
Unfoldings are a well known partial-order semantics of P/T Petri nets that can be applied to various model checking or verification problems. For high-level Petri nets, the so-called symbolic unfolding generalizes this notion. A complete…
The category of flows is not cartesian closed. We construct a closed symmetric monoidal structure which has moreover a satisfactory behavior from the computer scientific viewpoint.
We construct in a unifying way skew-multicategories and multicategories of double and Gray-categories that we call Gray (skew) multicategories. We study their different versions depending on the types of functors and higher transforms. We…
In previous work, Abramsky, Dawar and Wang (LiCS 2017) and Abramsky and Shah (CSL 2018) have shown how a range of model comparison games which play a central role in finite model theory, including Ehrenfeucht-Fraisse, pebbling, and…
We prove that the well-known (strong) fully-concurrent bisimilarity and the novel i-causal-net bisimilarity, which is a sligtlhy coarser variant of causal-net bisimilarity, are decidable for finite bounded Petri nets. The proofs are based…
We prove that $\omega$-languages of (non-deterministic) Petri nets and $\omega$-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of $\omega$-languages of…
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 $\mathsf{Q}$-nets, a generalization…