English
Related papers

Related papers: Computational Petri Nets: Adjunctions Considered H…

200 papers

We prove that the free algebra functor associated to a symmetric, pseudo commutative 2-monad, from the underlying symmetric monoidal 2-category to the 2-category of algebras and pseudo maps over the 2-monad can be enhanced to a…

Category Theory · Mathematics 2025-09-19 Diego Manco

The goal of this paper is to develop a theory of join and slices for strict $\infty$-categories. To any pair of strict $\infty$-categories, we associate a third one that we call their join. This operation is compatible with the usual join…

Category Theory · Mathematics 2020-09-25 Dimitri Ara , Georges Maltsiniotis

Petri net synthesis consists in deciding for a given transition system $A$ whether there exists a Petri net $N$ whose reachability graph is isomorphic to $A$. Several works examined the synthesis of Petri net subclasses that restrict, for…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Raymond Devillers , Ronny Tredup

We consider two $d \geq 2$ conformal field theories (CFTs) glued together along a codimension one conformal interface. The conformal anomaly of such a system contains both bulk and interface contributions. In a curved-space setup, we…

High Energy Physics - Theory · Physics 2020-12-02 Christopher P. Herzog , Kuo-Wei Huang , Dmitri V. Vassilevich

In reversible computations one is interested in the development of mechanisms allowing to undo the effects of executed actions. The past research has been concerned mainly with reversing single actions. In this paper, we consider the…

Formal Languages and Automata Theory · Computer Science 2023-06-22 David de Frutos Escrig , Maciej Koutny , Łukasz Mikulski

The aim of this thesis is to investigate the Betti diagrams of squarefree monomial ideals in polynomial rings. We use two key tools to help us study these diagrams. The first is the Stanley-Reisner Correspondence, which assigns a unique…

Commutative Algebra · Mathematics 2024-01-12 David Carey

Given a symmetric operad $P$, and a signature (or generating sequence) $\Phi$ for $P$, we define a notion of the "categorification" (or "weakening") of $P$ with respect to $\Phi$. When $P$ is the symmetric operad whose algebras are…

Category Theory · Mathematics 2007-12-03 Miles Gould

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

Logic in Computer Science · Computer Science 2024-01-30 C. B. Aberlé

Reversible computations constitute an unconventional form of computing where any sequence of performed operations can be undone by executing in reverse order at any point during a computation. It has been attracting increasing attention as…

Computation and Language · Computer Science 2023-06-22 Kamila Barylska , Anna Gogolińska

It was shown by Ostrik (2003) and Natale (2017) that a collection of twisted group algebras in a pointed fusion category serve as explicit Morita equivalence class representatives of indecomposable, separable algebras in such categories. We…

Quantum Algebra · Mathematics 2023-06-27 Yiby Morales , Monique Müller , Julia Plavnik , Ana Ros Camacho , Angela Tabiri , Chelsea Walton

We introduce nominal string diagrams as, string diagrams internal in the category of nominal sets. This requires us to take nominal sets as a monoidal category, not with the cartesian product, but with the separated product. To this end, we…

Logic in Computer Science · Computer Science 2019-04-17 Samuel Balco , Alexander Kurz

Place/transition Petri nets are a standard model for a class of distributed systems whose reachability spaces might be infinite. One of well-studied topics is the verification of safety and liveness properties in this model; despite the…

Logic in Computer Science · Computer Science 2016-08-09 Petr Jancar

Applied category theory often studies symmetric monoidal categories (SMCs) whose morphisms represent open systems. These structures naturally accommodate complex wiring patterns, leveraging (co)monoidal structures for splitting and merging…

Category Theory · Mathematics 2025-09-03 Marius Furter , Yujun Huang , Gioele Zardini

A simplicial set is said to be non-singular if the representing map of each non-degenerate simplex is degreewise injective. The inclusion into the category of simplicial sets, of the full subcategory whose objects are the non-singular…

Algebraic Topology · Mathematics 2020-01-17 Vegard Fjellbo

In this survey paper we give account of several approaches to the strictification and non-strictification of monoidal categories, which are constructions that turn a monoidal category into a (non-)strict one monoidally equivalent to the…

Category Theory · Mathematics 2024-12-31 Jorge Becerra

When checking concurrent software using a finite-state model, we face a formidable state explosion problem. One solution to this problem is dependence-based program slicing, whose use can effectively reduce verification time. It is…

Software Engineering · Computer Science 2023-11-16 Zhijun Ding , Shuo Li , Cheng Chen , Cong He

We study the accessibility properties of trivial cofibrations and weak equivalences in a combinatorial model category and prove an estimate for the accessibility rank of weak equivalences. In particular, we show that the class of weak…

Algebraic Topology · Mathematics 2015-05-13 G. Raptis , J. Rosický

We study the monoidal closed category of symmetric multicategories, especially in relation with its cartesian structure and with sequential multicategories (whose arrows are sequences of concurrent arrows in a given category). Then we…

Category Theory · Mathematics 2014-02-04 Claudio Pisani

We extend the classification results for torsion classes and torsion-free classes in the category of finitely generated modules over a commutative noetherian ring to suitable symmetric monoidal closed noetherian abelian categories. Our main…

Representation Theory · Mathematics 2026-04-29 Shunya Saito

In recent work, the second and third authors introduced a technique for reachability checking in 1-bounded Petri nets, based on wiring decompositions, which are expressions in a fragment of the compositional algebra of nets with boundaries.…

Logic in Computer Science · Computer Science 2013-04-12 Julian Rathke , Pawel Sobocinski , Owen Stephens
‹ Prev 1 8 9 10 Next ›