Related papers: Path category for free - Open morphisms from coalg…
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…
Fong developed `decorated cospans' to model various kinds of open systems: that is, systems with inputs and outputs. In this framework, open systems are seen as the morphisms of a category and can be composed as such, allowing larger open…
We show that morphisms from n A_infinity-algebras to a single one are maps over an operad module with n+1 commuting actions of the operad A_infinity, whose algebras are conventional A_infinity-algebras. Similar statement holds for homotopy…
We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional…
This paper formulates a notion of independence of subobjects of an object in a general (i.e. not necessarily concrete) category. Subobject independence is the categorial generalization of what is known as subsystem independence in the…
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…
Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to unify…
General frameworks have been recently proposed as unifying theories for processes combining non-determinism with quantitative aspects (such as probabilistic or stochastically timed executions), aiming to provide general results and tools.…
Given a variety of universal algebras. A method is suggested for describing automorphisms of a category of free algebras of this variety. Applying this general method all automorphisms of such categories are found in two cases: 1) for the…
We give an explicit way of calculating the set of homotopy classes of morphisms from a Tamsamani n-category A to another one B. This calculation uses a Reedy-cofibrant cosimplicial resolution of A, using a new notion of ``free cofibration''…
We want to replace categories, functors and natural transformations by categories, open functors and open natural transformations. In analogy with open dynamical systems, the adjective open is added here to mean that some external…
Context-free session types provide a typing discipline for recursive structured communication protocols on bidirectional channels. They overcome the restriction of regular session type systems to tail recursive protocols. This extension…
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…
The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework…
We study Hom-type analogs of Rota-Baxter and dendriform algebras, called Rota-Baxter $G$-Hom-associative algebras and Hom-dendriform algebras. Several construction results are proved. Free algebras for these objects are explicitly…
The theory of coalgebras, for an endofunctor on a category, has been proposed as a general theory of transition systems. We investigate and relate four generalizations of bisimulation to this setting, providing conditions under which the…
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…
Applied category theory has recently developed libraries for computing with morphisms in interesting categories, while machine learning has developed ways of learning programs in interesting languages. Taking the analogy between categories…
We describe an algebraic chain level construction that models the passage from an arbitrary topological space to its free loop space. The input of the construction is a categorical coalgebra, i.e. a curved coalgebra satisfying certain…
We endow the category of bialgebras over a pair of operads in distribution with a cofibrantly generated model category structure. We work in the category of chain complexes over a field of characteristic zero. We split our construction in…