Search

A directed space is a topological space $X$ together with a subspace $\vec {P}(X)\subset X^I$ of directed paths on $X$. A symmetry of a directed space should therefore respect both the topology of the underlying space and the topology of the associated spaces $\vec {P}(X)_-^+$ of directed paths between a source ($-$) and a target ($+$)—up to homotopy. If it is, moreover, homotopic to the identity map—in a directed sense—such a symmetry will be called an inessential d-map, and the paper explores the algebra and topology of inessential d-maps. Comparing two d-spaces $X$ and $Y$ 'up to symmetry' yields the notion of a directed homotopy equivalence between them. Under appropriate conditions, all directed homotopy equivalences are shown to satisfy a 2-out-of-3 property. Our notion of directed homotopy equivalence does not agree completely with the one defined in Goubault (2017, arxiv:1709:05702v2) and Goubault, Farber and Sagnier (2020, J. Appl. Comput. Topol. 4, 11–27); the deviation is motivated by examples. Nevertheless, directed topological complexity, introduced in Goubault, Farber and Sagnier (2020) is shown to be invariant under our notion of directed homotopy equivalence. Finally, we show that directed homotopy equivalences result in isomorphisms on the pair component categories of directed spaces introduced in Goubault, Farber and Sagnier (2020). [ABSTRACT FROM AUTHOR]

Directed paths have been used by several authors to describe concurrent executions of a program. Spaces of directed paths in an appropriate state space contain executions with all possible legal schedulings. It is interesting to investigate whether one obtains different topological properties of such a space of executions if one restricts attention to schedulings with "nice" properties, e.g. involving synchronisations. This note shows that this is not the case, i.e. that one may operate with nice schedulings without inflicting any harm. Several of the results in this note had previously been obtained by Ziemiański in Ziemiański (2017. Applicable Algebra in Engineering, Communication and Computing28 497–525; 2020a. Journal of Applied and Computational Topology4 (1) 45–78). We attempt to make them accessible for a wider audience by giving an easier proof for these findings by an application of quite elementary results from algebraic topology; notably the nerve lemma. [ABSTRACT FROM AUTHOR]

We compute the homology of the spaces of directed paths on a certain class of cubical subcomplexes of the directed Euclidean space $$\mathbb{R }^n$$ by a recursive process. We apply this result to calculate the homology and cohomology of the space of directed loops on the $$(n-1)$$ -skeleton of the directed torus $$\vec {T}^n$$ . [ABSTRACT FROM AUTHOR]

Higher dimensional automata (HDA) are highly expressive models for concurrency in Computer Science, cf van Glabbeek (Theor Comput Sci 368(1-2):168-194, ). For a topologist, they are attractive since they can be modeled as cubical complexes-with an inbuilt restriction for directions of allowable (d-)paths. In Raussen (Algebr Geom Topol 10:1683-1714, ), we developed a new method describing, for a certain subclass of HDA, the homotopy type of the space of execution paths (d-paths) as a finite simplicial complex. Several restrictions that were made to ease the presentation in that latter paper will be removed in the present article in order to make the results applicable in greater generality. Furthermore, we take a close look at semaphore models with semaphores all of arity one. It turns out that execution spaces for these are always homotopy discrete with components representing sets of 'compatible' permutations. Finally, we describe a model for the complement of the execution space seen as a subspace of a product of spheres-with the aim to make the calculation of topological invariants easier and faster. [ABSTRACT FROM AUTHOR]

In [1], we performed a systematic investigation of reparametrizations of continuous paths in a Hausdorff space that relies crucially on a proper understanding of stop data of a (weakly increasing) reparametrization of the unit interval. I am grateful to Marco Grandis (Genova) for pointing out to me that the proof of Proposition 3.7 in [1] is wrong. Fortunately, the statement of that Proposition and the results depending on it stay correct. It is the purpose of this note to provide correct proofs. [ABSTRACT FROM AUTHOR]

This article intends to provide some new insights into concurrency using ideas from the theory of dynamical systems. Inherently discrete concurrency corresponds to a parallel continuous concept: a discrete state space corresponds to a differential manifold, an execution path corresponds to a flow line of a dynamical system. To model non-determinacy within dynamical systems, we introduce a new geometrical object, a section cone. A section cone is a convex set in the space of vector fields, all elements having the same singular points. We show that it is enough to consider flow lines of a single vector field in order to capture the behavior of all flow lines in the section cone up to homotopy (corresponding to equivalence of executions). [ABSTRACT FROM AUTHOR]

Describes the behavior of concurrent systems in computer science. Invariants of the state space; Categories of fractions of the fundamental category of the state space; Related quotient categories of components.