Related papers: Homotopy Bisimilarity for Higher-Dimensional Autom…

There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span of G-coalgebra homomorphism. Another one is in terms of path…

In this paper we provide an explicit general construction of higher homotopy operations in model categories, which include classical examples such as (long) Toda brackets and (iterated) Massey products, but also cover unpointed operations…

The strict globular $\omega$-categories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) $\omega$-category $\C$ three homology theories. The first one is called the…

In the open map approach to bisimilarity, the paths and their runs in a given state-based system are the first-class citizens, and bisimilarity becomes a derived notion. While open maps were successfully used to model bisimilarity in…

This work contributes to clarifying several relationships between certain higher categorical structures and the homotopy types of their classifying spaces. Double categories (Ehresmann, 1963) have well-understood geometric realizations, and…

In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…

We introduce the persistent homotopy type distance dHT to compare real valued functions defined on possibly different homotopy equivalent topological spaces. The underlying idea in the definition of dHT is to measure the minimal shift that…

Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite…

Let $D$ be a large category which is cocomplete. We construct a model structure (in the sense of Quillen) on the category of small functors from $D$ to simplicial sets. As an application we construct homotopy localization functors on the…

We introduce a new class of possibly noncompact n-dimensional manifolds without boundary associated to finite data which we call topological automata. This class is large enough to contain many interesting examples of open 2-dimensional and…

We prove that the homotopy theory of cofibration categories is equivalent to the homotopy theory of cocomplete quasicategories. This is achieved by presenting both homotopy theories as fibration categories and constructing an explicit…

We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…

One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…

An appropriate framework is put forward for the construction of $\lambda$-models with $\infty$-groupoid structure, which we call \textit{homotopic $\lambda$-models}, through the use of an $\infty$-category with cartesian closure and enough…

We define the notion of {\em classifying space} of a topological stack and show that every topological stack \X has a classifying space X which is a topological space well-defined up to weak homotopy equivalence. Under a certain…

We show that there are homotopy equivalences $h:N\to M$ between closed manifolds which are induced by cell-like maps $p:N\to X$ and $q:M\to X$ but which are not homotopic to homeomorphisms. The phenomenon is based on construction of…

We show "free theorems" in the style of Wadler for polymorphic functions in homotopy type theory as consequences of the abstraction theorem. As an application, it follows that every space defined as a higher inductive type has the same…

We define a simpler notion of symmetric topological complexity more ad hoc to the motion planning problem which was the original motivation for the definition of topological complexity. This is a homotopy invariant that we call…

We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…

Topologists are sometimes interested in space-valued diagrams over a given index category, but it is tricky to say what such a diagram even is if we look for a notion that is stable under equivalence. The same happens in (homotopy) type…