English
Related papers

Related papers: Relating coalgebraic notions of bisimulation

200 papers

We extend Barr's well-known characterization of the final coalgebra of a $Set$-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a $Set$-monad $\mathbf{M}$ for functors arising as liftings.…

Category Theory · Mathematics 2010-05-07 Adriana Balan , Alexander Kurz

We present a common framework to study varieties in great generality from a categorical point of view. The main application of this study is in the setting of algebraic categories, where we introduce Birkhoff varieties which are essentially…

Category Theory · Mathematics 2023-10-12 Jose Avila

We consider a spacetime formed by several pieces having common timelike boundary which plays the role of a junction between them. We establish junction conditions for fields of various spin and derive the resulting laws of wave propagation…

High Energy Physics - Theory · Physics 2009-10-31 P. I. Fomin , Yu. V. Shtanov

We consider conditional transition systems, that model software product lines with upgrades, in a coalgebraic setting. By using Birkhoff's duality for distributive lattices, we derive two equivalent Kleisli categories in which these…

Logic in Computer Science · Computer Science 2023-06-22 Harsh Beohar , Barbara König , Sebastian Küpper , Alexandra Silva , Thorsten Wißmann

We prove a general congruence result for bisimilarity in higher-order languages, which generalises previous work to languages specified by a labelled transition system in which programs may occur as labels, and which may rely on operations…

Logic in Computer Science · Computer Science 2023-03-22 Tom Hirschowitz , Ambroise Lafont

We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…

Logic in Computer Science · Computer Science 2020-08-24 Jim de Groot , Helle Hvid Hansen , Alexander Kurz

In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…

Logic in Computer Science · Computer Science 2024-04-02 Andrés Gallardo , Ignacio Viglizzo

We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…

Combinatorics · Mathematics 2007-05-23 N. Raghavendra

There are various generalizations of bialgebras to their ''many object'' versions, such as quantum categories, bialgebroids and weak bialgebras. These can also be thought of as quantum analogues of small categories. In this paper we study…

Category Theory · Mathematics 2010-08-10 Dimitri Chikhladze

Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…

Category Theory · Mathematics 2022-05-12 Tomáš Jakl , Dan Marsden , Nihil Shah

Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational semantics of a system, by means of a distributive law between its syntax (encoded as a monad) and its dynamics (an endofunctor). This setup is…

Logic in Computer Science · Computer Science 2019-07-03 Filippo Bonchi , Robin Piedeleu , Pawel Sobocinski , Fabio Zanasi

We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the equivalence of four notions of representability of rational streams:…

Logic in Computer Science · Computer Science 2015-07-01 J. J. M. M. Rutten

Motivated by the need to reason about hybrid systems, we study limits in categories of coalgebras whose underlying functor is a Vietoris polynomial one - intuitively, the topological analogue of a Kripke polynomial functor. Among other…

Logic in Computer Science · Computer Science 2019-03-14 Dirk Hofmann , Renato Neves , Pedro Nora

We develop the theory of frames and Parseval frames for finite-dimensional vector spaces over the binary numbers. This includes characterizations which are similar to frames and Parseval frames for real or complex Hilbert spaces, and the…

Functional Analysis · Mathematics 2009-06-19 Bernhard G. Bodmann , My Le , Letty Reza , Matthew Tobin , Mark Tomforde

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

Logic in Computer Science · Computer Science 2018-04-23 Francesco Dagnino

We study coalgebraic modal logic to characterise behavioural equivalence in the presence of side effects, i.e., when coalgebras live in a (co)Kleisli or an Eilenberg-Moore category. Our aim is to develop a general framework based on indexed…

Logic in Computer Science · Computer Science 2022-02-07 H. Beohar , B. König , S. Küpper , C. Mika-Michalski

Several notions of bisimulation relations for probabilistic non-deterministic transition systems have been considered in the literature. We consider a novel testing-based behavioral equivalence called upper-expectation bisimilarity and…

Logic in Computer Science · Computer Science 2013-10-03 Matteo Mio

We survey recent results on the representation theory of symplectic reflection algebras, focusing particularly on connections with symplectic quotient singularities and their resolutions, spaces of representations of quivers, and on…

Representation Theory · Mathematics 2007-12-11 Iain Gordon

Behavioural equivalences can be characterized via bisimulations, modal logics and spoiler-defender games. In this paper we review these three perspectives in a coalgebraic setting, which allows us to generalize from the particular branching…

Logic in Computer Science · Computer Science 2021-04-20 Barbara König , Christina Mika-Michalski

In this paper, we describe a general theory of modules over an algebra over an operad. We also study functors between categories of modules. Specializing to the operad E_d of little d-dimensional disks, we show that each (d-1)-manifold…

Algebraic Topology · Mathematics 2015-02-02 Geoffroy Horel
‹ Prev 1 3 4 5 6 7 10 Next ›