English
Related papers

Related papers: Relating coalgebraic notions of bisimulation

200 papers

In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final…

Logic in Computer Science · Computer Science 2016-07-12 Marco Peressotti

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra…

Logic in Computer Science · Computer Science 2023-01-25 Rob van Glabbeek

We introduce the concept of cotensor coalgebra for a given bicomodule over a coalgebra in an abelian monoidal category. Under some further conditions we show that such a cotensor coalgebra exists and satisfies a meaningful universal…

Quantum Algebra · Mathematics 2010-08-27 A. Ardizzoni , C. Menini , D. Stefan

The modelling, specification and study of the semantics of concurrent reactive systems have been interesting research topics for many years now. The aim of this thesis is to exploit the strengths of the (co)algebraic framework in modelling…

Logic in Computer Science · Computer Science 2015-02-11 Georgiana Caltais

We investigate a canonical way of defining bisimilarity of systems when their semantics is given by a coreflection, typically in a category of transition systems. We use the fact, from Joyal et al., that coreflections preserve open…

Logic in Computer Science · Computer Science 2018-09-26 Jérémy Dubut , Ichiro Hasuo , Shin-ya Katsumata , David Sprunger

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour…

Logic in Computer Science · Computer Science 2013-09-05 Corina Cirstea

We study the notion of a bifibration in simplicial sets which generalizes the classical notion of two-sided discrete fibration studied in category theory. If $A$ and $B$ are simplicial sets we equip the category of simplicial sets over…

Algebraic Topology · Mathematics 2018-07-24 Danny Stevenson

Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algebra of relations that has proved especially useful in recent…

Logic in Computer Science · Computer Science 2020-03-24 Filippo Bonchi , Jens Seeber , Pawel Sobocinski

We introduce the concept of Frobenius theory as a generalisation of Lawvere's functorial semantics approach to categorical universal algebra. Whereas the universe for models of Lawvere theories is the category of sets and functions, or more…

Logic in Computer Science · Computer Science 2017-11-27 Filippo Bonchi , Dusko Pavlovic , Pawel Sobocinski

In this paper we present methods of transition from one perspective on logic to others, and apply this in particular to obtain a coalgebraic presentation of logic. The central ingredient in this process is to view consequence relations as…

Logic · Mathematics 2012-02-07 Dirk Hofmann , Manuel A. Martins

Bigraphs and their algebra is a model of concurrency. Fuzzy bigraphs are a generalization of birgraphs intended to be a model of concurrency that incorporates vagueness. More specifically, this model assumes that agents are similar,…

Logic in Computer Science · Computer Science 2020-02-18 Apostolos Syropoulos

B-systems are algebras (models) of an essentially algebraic theory that is expected to be constructively equivalent to the essentially algebraic theory of C-systems which is, in turn, constructively equivalent to the theory of contextual…

Logic · Mathematics 2014-10-21 Vladimir Voevodsky

Bisimilarity is a central notion for coalgebras. In recent work, Geuvers and Jacobs suggest to focus on apartness, which they define by dualising coalgebraic bisimulations. This yields the possibility of finite proofs of distinguishability…

Logic in Computer Science · Computer Science 2024-04-26 Ruben Turkenburg , Harsh Beohar , Clemens Kupke , Jurriaan Rot

We prove that every finitary polynomial endofunctor of a category $C$ has a final coalgebra if $C$ is locally Cartesian closed, has finite disjoint coproducts and a natural number object. More generally, we prove that the category of…

Category Theory · Mathematics 2007-05-23 Luigi Santocanale

In this article we present a unification of the theory of algebraic, singular, topological and directional transition matrices by introducing the (generalized) transition matrix which encompasses each of the previous four. Some transition…

Dynamical Systems · Mathematics 2014-11-14 Ewerton Vieira , Robert Franzosa

2-Theories are a canonical way of describing categories with extra structure. 2-theory-morphisms are used when discussing how one structure can be replaced with another structure. This is central to categorical coherence theory. We place a…

Category Theory · Mathematics 2007-05-23 Noson S. Yanofsky

A general theory of the Frolicher-Nijenhuis and Schouten-Nijenhuis brackets in the category of modules over a commutative algebra is described. Some related structures and (co)homology invariants are discussed, as well as applications to…

Differential Geometry · Mathematics 2010-01-30 Iosif Krasil'shchik

Aczel-Mendler bisimulations are a coalgebraic extension of a variety of computational relations between systems. It is usual to assume that the underlying category satisfies some form of the axiom of choice, so that the collection of…

Logic in Computer Science · Computer Science 2025-09-10 Jeremy Dubut

We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…

Logic · Mathematics 2017-05-26 Luca Mauri