The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in tutorial detail. So why should these phenomena prefer one home over the other? We identify dimension as the culprit: 1dimensional automata are skeletons permitting only interleaving concurrency, whereas true n-fold concurrency resides in transitions of dimension n. The truly concurrent automaton dual to a schedule is not a skeletal distributive lattice but a solid one. We introduce true nondeterminism and define it as monoidal homotopy; from this perspective nondeterminism in ordinary automata arises from forking and joining creating nontrivial homotopy. The automaton dual to a poset schedule is simply connected whereas that dual to an event structure schedule need not be, according to monoidal homotopy though not to group homotopy. We conclude...

We give a definition of weak n-categories based on the theory of operads. We work with operads having an arbitrary set S of types, or ‘S-operads’, and given such an operad O, we denote its set of operations by elt(O). Then for any S-operad O there is an elt(O)-operad O + whose algebras are S-operads over O. Letting I be the initial operad with a one-element set of types, and defining I 0+ = I, I (i+1)+ = (I i+) +, we call the operations of I (n−1)+ the ‘n-dimensional opetopes’. Opetopes form a category, and presheaves on this category are called ‘opetopic sets’. A weak n-category is defined as an opetopic set with certain properties, in a manner reminiscent of Street’s simplicial approach to weak ω-categories. In a similar manner, starting from an arbitrary operad O instead of I, we define ‘n-coherent O-algebras’, which are n times categorified analogs of algebras of O. Examples include ‘monoidal n-categories’, ‘stable n-categories’, ‘virtual n-functors ’ and ‘representable n-prestacks’. We also describe how n-coherent O-algebra objects may be defined in any (n + 1)-coherent O-algebra. 1

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 globular homology. It contains the oriented loops of C. The two other ones are called the negative (resp. positive) corner homology. They contain in a certain manner the branching areas of execution paths or negative corners (resp. the merging areas of execution paths or positive corners) of C. Two natural linear maps called the negative (resp. the positive) Hurewicz morphism from the globular homology to the negative (resp. positive) corner homology are constructed. We explain the reason why these constructions allow the reinterpretation of some geometric problems coming from computer science.

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 not found

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.

We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of [Gau99] disappear. Moreover the important morphisms which associate to every globe its corresponding branching area and merging area of execution paths become morphisms of simplicial sets.

The purpose of this paper is to develop some additional techniques for the weak n-categories defined by Tamsamani in [27] (which he calls n-nerves). The goal is to be able to define the internal Hom(A, B) for two n-nerves A and B, which should itself be an n-nerve. This in turn is for defining the n + 1-nerve nCAT of all n-nerves conjectured in