Related papers: A Categorical Semantics for Guarded Petri Nets
We define bicategories internal to 2-categories. When the ambient 2-category is symmetric monoidal categories, this provides a convenient framework for encoding the structures of a symmetric monoidal 3-category. This framework is well…
We develop the Witt group for certain braided monoidal categories with duality. In case of a braided fusion category over an algebraically closed field of characteristic zero, we explicitly describe this structure. We then use this…
We give a full classification of all braided semisimple tensor categories whose Grothendieck semiring is the one of Rep(O(\infty) (formally), Rep(O(N), Rep(Sp(N) or of one of its associated fusion categories. If the braiding is not…
A linear Gr-category is a category of finite-dimensional vector spaces graded by a finite group together with natural tensor product. We classify the braided monoidal structures of a class of linear Gr-categories via explicit computations…
We define the Grothendieck-Witt category over a fixed ground ring. In order to study the structure of this category, we introduce the general theory of Gysin functors and their associated categories of correspondences. The latter…
In this paper we study Hornets extended with firing probabilities. Hornets are a Nets-within-Nets formalism, i.e., a Petri net formalism where the tokens are Petri nets again. Each of these net-tokens has its own firing rate, independent…
CP-nets and their variants constitute one of the main AI approaches for specifying and reasoning about preferences. CI-nets, in particular, are a CP-inspired formalism for representing ordinal preferences over sets of goods, which are…
We consider the abelian group $PT$ generated by quasi-equivalence classes of pretriangulated DG categories with relations coming from semi-orthogonal decompositions of corresponding triangulated categories. We introduce an operation of…
Knop constructed a tensor category associated to a finitely-powered regular category equipped with a degree function. In recent work with Harman, we constructed a tensor category associated to an oligomorphic group equipped with a measure.…
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…
In quantum logical terms, Hardy-type arguments can be uniformly presented and extended as collections of intertwined contexts and their observables. If interpreted classically those structures serve as graph-theoretic "gadgets" that enforce…
We present a concurrent operational Petri net semantics for the join-calculus, a process calculus for specifying concurrent and distributed systems. There often is a gap between system specifications and the actual implementations caused by…
Non-interference, in transitive or intransitive form, is defined here over unbounded (Place/Transition) Petri nets. The definitions are adaptations of similar, well-accepted definitions introduced earlier in the framework of labelled…
We introduce semidirect products of skew monoidal categories as a categorification of semidirect products of monoids (or, perhaps more familiarly, of groups). We also discuss how this construction interacts with monoidal, autonomous and…
In this paper we study compact closed categories within the context of homotopical algebra. We construct two new model category structures by localizing two (Quillen equivalent) model categories of symmetric monoidal categories with the…
We compare closed and rigid monoidal categories. Closedness is defined by the tensor product having a right adjoint: the internal hom functor. Rigidity, on the other hand, generalises the duality of finite-dimensional vector spaces. In the…
Completeness proofs in categorical semantics usually proceed by building a syntactic category whose composition is given by substitution. For untyped effectful Call-by-Value languages, this runs into a basic obstacle: there is no canonical…
The analysis of games played on graph-like structures is of increasing importance due to the prevalence of social networks, both virtual and physical, in our daily life. As well as being relevant in computer science, mathematical analysis…
This paper shows how proof nets can be used to formalize the notion of ``incomplete dependency'' used in psycholinguistic theories of the unacceptability of center-embedded constructions. Such theories of human language processing can…
We begin with a brief sketch of what is known and conjectured concerning braided monoidal 2-categories and their applications to 4d topological quantum field theories and 2-tangles (surfaces embedded in 4-dimensional space). Then we give…