Related papers: Computational Petri Nets: Adjunctions Considered H…
Given a symmetric monoidal $(\infty,n)$-category $\mathcal{C}$ and a space $X$, we address the problem of explicitly describing the symmetric monoidal $(\infty,n)$-category freely obtained from $\mathcal{C}$ by adjoining $X$ new…
We extend the classical associative PI-theory to Associative Pairs, and in doing so, we introduce related notions already present for algebras (and Jordan systems) as the ones of PI-element and PI-ideal, extended centroid and central…
We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and define what it means…
This paper concerns the study of a class of clutters called simplicial subclutters. Given a clutter $\mathcal{C}$ and its simplicial subclutter $\mathcal{D}$, we compare some algebraic properties and invariants of the ideals $I, J$…
This paper introduces the concept of distorted monoidal categories, a generalization of monoidal and braided monoidal categories that supports non-reversible and direction-sensitive tensor structures. Unlike the classical setting, where the…
Flexible network design deals with building a network that guarantees some connectivity requirements between its vertices, even when some of its elements (like vertices or edges) fail. In particular, the set of edges (resp. vertices) of a…
The textbook proofs of Commoner's theorem characterizing liveness in free-choice Petri nets are given in contexts of technical notions and claims that make the proofs look a bit long. The aim of this note is to give a concise self-contained…
Event structures have emerged as a foundational model for concurrent computation, explaining computational processes by outlining the events and the relationships that dictate their execution. They play a pivotal role in the study of key…
We introduce {\omega}-Petri nets ({\omega}PN), an extension of plain Petri nets with {\omega}-labeled input and output arcs, that is well-suited to analyse parametric concurrent systems with dynamic thread creation. Most techniques (such as…
We present new algorithms for inference in credal networks --- directed acyclic graphs associated with sets of probabilities. Credal networks are here interpreted as encoding strong independence relations among variables. We first present a…
We develop the homotopy theory of semisimplicial sets constructively and without reference to point-set topology to obtain a constructive model for $\omega$-groupoids. Most of the development is folklore, but for a few results the author is…
We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Furthermore, our cost model…
Petri nets and their variants are often considered through their interleaved semantics, i.e. considering executions where, at each step, a single transition fires. This is clearly a miss, as Petri nets are a true concurrency model. This…
Context: Petri net slicing is a technique to reduce the size of a Petri net to ease the analysis or understanding of the original Petri net. Objective: Presenting two new Petri net slicing algorithms to isolate those places and transitions…
An important goal in studying the relations between unitary VOAs and conformal nets is to prove the equivalence of their ribbon categories. In this article, we prove this conjecture for many familiar examples. Our main idea is to construct…
In this paper we introduce the notion of spread net. Spread nets are (safe) Petri nets equipped with vector clocks on places and with ticking functions on transitions, and are such that vector clocks are consistent with the ticking of…
Gene regulatory network (GRN) plays a central role in system biology and genomics. It provides a promising way to model and study complex biological processes. Several computational methods have been developed for the construction and…
We define for each $n \geq 1$ a symmetric monoidal $(\infty, n+1)$-category $n\mathrm{Pr}^L$ whose objects we call presentable $(\infty,n)$-categories, generalizing the usual theory of presentable $(\infty,1)$-categories. We show that each…
We present a method of constructing monoidal, braided monoidal, and symmetric monoidal bicategories from corresponding types of monoidal double categories that satisfy a lifting condition. Many important monoidal bicategories arise…
Petri nets are an established graphical formalism for modeling and analyzing the behavior of systems. An important consideration of the value of Petri nets is their use in describing both the syntax and semantics of modeling formalisms.…