A local po-space is a gluing of topological spaces which are equipped with a closed partial ordering representing the time flow. They are used as a formalization of higher dimensional automata (see for instance [6]) which model concurrent systems in computer science. It is known [11] that there are two distinct notions of deformation of higher dimensional automata, “spatial” and “temporal”, leaving invariant computer scientific properties like presence or absence of deadlocks. Unfortunately, the formalization of these notions is still unknown in the general case of local po-spaces. We introduce here a particular kind of local po-space, the “globular CW-complexes”, for which we formalize these notions of deformations and which are sufficient to formalize

Concurrency, i.e., the domain in computer science which deals with parallel (asynchronous) computations, has very strong links with algebraic topology; this is what we are developing in this paper, giving a survey of “geometric” models for concurrency. We show that the properties we want to prove on concurrent systems are stable under some form of deformation, which is almost homotopy. In fact, as the “direction ” of time matters, we have to allow deformation only as long as we do not reverse the direction of time. This calls for a new homotopy theory: “directed ” or di-homotopy. We develop some of the geometric intuition behind this theory and give some hints about the algebraic objects one can associate with it (in particular homology groups). For some historic as well as for some deeper reasons, the theory is at a stage where there is a nice blend between cubical, ω-categorical and topological techniques.

We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner (or branching) homology of a globular #-category and the combinatorics of a new homology theory called the reduced branching homology. The latter is the homology of the quotient of the branching complex by the sub-complex generated by its thin elements. Conjecturally it coincides with the non reduced theory for higher dimensional automata, that is #-categories freely generated by precubical sets. As application, we calculate the branching homology of some #-categories and we give some invariance results for the reduced branching homology. We only treat the branching side. The merging side, that is the case of merging areas of execution paths is similar and can be easily deduced from the branching side.

Abstract. We construct a cofibrantly generated model structure on the category of flows such that any flow is fibrant and such that two cofibrant flows are homotopy equivalent for this model structure if and only if they are S-homotopy equivalent. This result provides an interpretation of the notion of S-homotopy equivalence in the framework of model

This paper is a survey of the new notions and results scattered in [13], [11] and [12]. Starting from a formalization of higher dimensional automata (HDA) by strict globular !-categories, the construction of a diagram of simplicial sets over the three-object small category gl ! + is exposed. Some of the properties discovered so far on the corresponding simplicial homology theories are explained, in particular their links with geometric problems coming from concurrency theory in computer science.

ABSTRACT. A number of reconfiguration problems in robotics, biology, computer science, combinatorics, and group theory coordinate local rules to effect global changes in system states. We define for any such reconfigurable system a cubical complex — the state complex — which coordinates independent local moves. We prove classification and realization theorems for state complexes, using CAT(0) geometry as the primary tool. We also classify the topology of spaces of optimal reconfiguration paths using techniques from CAT(0) geometry. 1.

Abstract In this paper I compare the expressive power of several models of concurrency based on their ability to represent causal dependence. To this end, I translate these models, in behaviour preserving ways, into the model of higher dimensional automata, which is the most expressive model under investigation. In particular, I propose four different translations of Petri nets, corresponding to the four different computational interpretations of nets found in the literature. I also extend various equivalence relations for concurrent systems to higher dimensional automata. These include the history preserving bisimulation, which is the coarsest equivalence that fully respects branching time, causality and their interplay, as well as the ST-bisimulation, a branching time respecting equivalence that takes causality into account to the extent that it is expressible by actions overlapping in time. Through their embeddings in higher dimensional automata, it is now well-defined whether members of different models of concurrency are equivalent.

This presentation is the sequel of a paper published in GETCO'00 proceedings where a research program to construct an appropriate algebraic setting for the study of deformations of higher dimensional automata was sketched. This paper focuses precisely on detailing some of its aspects. The main idea is that the category of homotopy types can be embedded in a new category of dihomotopy types, the embedding being realized by the Globe functor. In this latter category, isomorphism classes of objects are exactly higher dimensional automata up to deformations leaving invariant their computer scientific properties as presence or not of deadlocks (or everything similar or related). Some hints to study the algebraic structure of dihomotopy types are given, in particular a rule to decide whether a statement/notion concerning dihomotopy types is or not the lifting of another statement/notion concerning homotopy types. This rule does not enable to guess what is the lifting of a given notion/statement, it only enables to make the verification, once the lifting has been found.

One can associate to any strict globular omega-category three augmented simplicial nerves called the globular nerve, the branching and the merging semi-cubical nerves. If this strict globular omega-category is freely generated by a precubical set, then the corresponding homology theories contain different informations about the geometry of the higher dimensional automaton modeled by the precubical set. Adding inverses in this omega-category to any morphism of dimension greater than 2 and with respect to any composition laws of dimension greater than 1 does not change these homology theories. In such a framework, the globular nerve always satisfies the Kan condition. On the other hand, both branching and merging nerves never satisfy it, except in some very particular and uninteresting situations. In this paper, we introduce two new nerves (the branching and merging semi-globular nerves) satisfying the Kan condition and having conjecturally the same simplicial homology as the branching and merging semi-cubical nerves respectively in such framework. The latter conjecture is related to the thin elements conjecture already introduced in our previous papers.

The branching space of a flow is the topological space of germs of its nonconstant execution paths beginning in the same way. However, there exist weakly Shomotopy equivalent flows having non weakly homotopy equivalent branching spaces. This topological space is then badly behaved from a computer-scientific viewpoint since weakly S-homotopy equivalent flows must correspond to higher dimensional automata having the same computer-scientific properties. To overcome this problem, the homotopy branching space of a flow is introduced as the left derived functor of the branching space functor from the model category of flows to the model category of topological spaces. As an application, we use this new functor to correct the notion of weak dihomotopy equivalence, which did not identify enough flows in its previous version.