English
Related papers

Related papers: Cellular Monads from Positive GSOS Specifications

200 papers

This is the first of a pair of papers where we construct and investigate a closed monoidal structure on the category of generalized algebraic theories (in the sense of Cartmell). In the present text, as a starting point, we define the…

Category Theory · Mathematics 2025-11-18 Daniel Almeida

This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…

Multiagent Systems · Computer Science 2022-01-13 Pedro M. Sequeira , António P. Aguiar , João Hespanha

Motivated by the Model-Based Design process for Cyber-Physical Systems, we consider issues in conformance testing of systems. Conformance is a quantitative notion of similarity between the output trajectories of systems, which considers…

Systems and Control · Computer Science 2015-11-19 Houssam Abbas , Georgios Fainekos

A program of wide interest in modern conformal bootstrap studies is to numerically solve general conformal field theories, based on a critical assumption that the dynamics is encoded in the conformal four-point crossing equations and…

High Energy Physics - Theory · Physics 2022-04-21 Zhijin Li

In this paper we answer a question raised in [25], Sec. 4, by showing that the genus zero moduli operad $\{\bar{M}_{0,n+1}\}$ can be endowed with natural descent data that allow it to be considered as the lift to ${\rm Spec}\,\Z$ of an…

Algebraic Geometry · Mathematics 2013-05-24 Yuri I. Manin , Matilde Marcolli

Digital circuits, despite having been studied for nearly a century and used at scale for about half that time, have until recently evaded a fully compositional theoretical in which arbitrary circuits may be freely composed together without…

Logic in Computer Science · Computer Science 2026-05-25 Dan R. Ghica , George Kaye , David Sprunger

The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since…

Logic in Computer Science · Computer Science 2015-07-01 Filippo Bonchi , Ugo Montanari

We discuss free probability theory and free harmonic analysis from a categorical perspective. In order to do so, we extend first the set of analytic convolutions and operations and then show that the comonadic structure governing free…

Probability · Mathematics 2017-09-12 Roland M. Friedrich

Notions of `operad' and `multicategory' abound. This work provides a single framework in which many of these various notions can be expressed. Explicitly: given a monad * on a category S, we define the term `(S,*)-multicategory', subject to…

Category Theory · Mathematics 2007-05-23 Tom Leinster

We introduce the abstract notions of "monadic operational semantics", a small-step semantics where computational effects are modularly modeled by a monad, and "type-and-effect system", including "effect types" whose interpretation lifts…

Programming Languages · Computer Science 2025-04-15 Francesco Dagnino , Paola Giannini , Elena Zucca

We introduce shift algebras as certain crossed product algebras based on general function spaces and study properties, as well as the classification, of a particular class of modules depending on a set of matrix parameters. It turns out…

Quantum Algebra · Mathematics 2022-01-13 Joakim Arnlind , Andreas Sykora

We introduce the notion of being cohomologically complete for objects of the derived category of sheaves of $Z[\hbar]$-modules on a topological space. Then we consider a $Z[\hbar]$-algebra satisfying some suitable conditions and prove…

Quantum Algebra · Mathematics 2010-03-22 Masaki Kashiwara , Pierre Schapira

This paper explicitely constructs cofree coalgebras over operads in the category of DG-modules. Special cases are considered in which the general expression simplifies (such as the pointed, irreducible case). It is shown that the existence…

Algebraic Topology · Mathematics 2007-05-23 Justin R. Smith

We analyse compatibility between monads and monoidal structures in the two-dimensional setting. We describe sufficient conditions for monoidal structures to lift to the Eilenberg-Moore pseudoalgebras. We then extend these results to braids,…

Category Theory · Mathematics 2024-02-20 Adrian Miranda

A moment category is endowed with a distinguished set of split idempotents, called moments, which can be transported along morphisms. Equivalently, a moment category is a category with an active/inert factorisation system fulfilling two…

Category Theory · Mathematics 2023-03-14 Clemens Berger

In this article, we discuss the family of cellular automata generated by so-called idempotent cellular automata (CA G such that G^2 = G) on the full shift. We prove a characterization of products of idempotent CA, and show examples of CA…

Dynamical Systems · Mathematics 2012-06-05 Ville Salo

We define a construction on operads which yields a new description of the minimal model. The construction also allows us to define algebraic structures on the homology of chain complexes with homologously trivial operad algebra structures,…

Algebraic Topology · Mathematics 2015-08-17 Cole Hugelmeyer

We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that…

Logic in Computer Science · Computer Science 2026-04-09 Martín Santiago Moroni , Pedro Sánchez Terraf

This thesis revolves around an area of computer science called "semantics". We work with operational semantics, equational theories, and denotational semantics. The first contribution of this thesis is a study of the commutativity of…

Logic in Computer Science · Computer Science 2024-06-12 Louis Lemonnier

While object diagrams (ODs) are widely used as a means to document object-oriented systems, they are expressively weak, as they are limited to describe specific possible snapshots of the system at hand. In this paper we introduce modal…

Software Engineering · Computer Science 2014-09-09 Shahar Maoz , Jan Oliver Ringert , Bernhard Rumpe