Homotopy invariants of higher dimensional categories and concurrency in computer science

  title={Homotopy invariants of higher dimensional categories and concurrency in computer science},
  author={Philippe Gaucher},
  journal={Mathematical Structures in Computer Science},
  pages={481 - 524}
  • P. Gaucher
  • Published 26 February 1999
  • Mathematics
  • Mathematical Structures in Computer Science
The strict globular ω-categories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) ω-category [Cscr ] three homology theories. The first one is called the globular homology. It contains the oriented loops of [Cscr ]. The two other ones are called the negative (respectively, positive) corner homology. They contain in a certain manner the branching areas of execution paths or negative corners (respectively, the merging areas of… 

Combinatorics of branchings in higher dimensional automata

The combinatorial properties of the branchingareas of execution paths in higher dimensional automata are explored and the branchinghomolog y of some ω- categories is calculated and some invariance results for the reduced branching homology are given.

Topological deformation of higher dimensional automata

The category of globular CW-complexes is introduced, which provides a rigorous mathematical foundation to study from an algebraic topology point of view higher dimensional automata and concurrent computations.


This paper gives a survey of “geometric” models for concurrency, and develops some of the geometric intuition behind this theory and gives some hints about the algebraic objects one can associate with it (in particular homology groups).

From Concurrency to Algebraic Topology

On the Cubical Homology Groups of Free Partially Commutative Monoids

We study a Leech homology of a locally bounded free partially commutative monoid M(E, I). Given a contravariant natural system of abelian groups F on M(E, I) we build a precubical set T(E, I) with a

Directed Algebraic Topology: Models of Non-Reversible Worlds

This is the first authored book to be dedicated to the new field of directed algebraic topology that arose in the 1990s, in homotopy theory and in the theory of concurrent processes. Its general aim

A T ] 2 4 Ju l 2 00 2 Topological Deformation of Higher Dimensional Automata

A particular kind of local po-space is introduced, the “globular CW-complexes”, for which these notions of deformations are formalized and which are sufficient to formalize higher dimensional automata.

Algebraic topology and concurrency

A T ] 8 J ul 2 00 1 Topological Deformation of Higher Dimensional Automata

Globular CW-complexes provide a rigorous mathematical foundation to study from an algebraic topology point of view higher dimensional automata and concurrent computations.

Concurrent Process up to Homotopy (I)




Handbook of Categorical Algebra

The Handbook of Categorical Algebra is intended to give, in three volumes, a rather detailed account of what, ideally, everybody working in category theory should know, whatever the specific topic of

Simplicial objects in algebraic topology

Since it was first published in 1967, Simplicial Objects in Algebraic Topology has been the standard reference for the theory of simplicial sets and their relationship to the homotopy theory of

Pasting Schemes for the Monoidal Biclosed Structure on

Using the theory of pasting presentations, developed in chapter 2, I give a detailed description of the tensor product on !-categories, which extends Gray's tensor product on 2-categories and which

An introduction to homological algebra

Preface 1. Generalities concerning modules 2. Tensor products and groups of homomorphisms 3. Categories and functors 4. Homology functors 5. Projective and injective modules 6. Derived functors 7.

Detecting Deadlocks in Concurrent Systems

A new algorithm is described and fully assessed, which not only computes the dead-locking states of a concurrent system but also the so-called unsafe region which consists of the states which will eventually lead to a dead- locking state.

Investigation of concurrent processes by means of homotopy functors

  • S. Sokolowski
  • Mathematics, Computer Science
    Mathematical Structures in Computer Science
  • 2002
A method for translating concurrent systems into partially ordered sets in a functorial way, in a way resembling the construction of the fundamental groups in topology.

Categories for the Working Mathematician

I. Categories, Functors and Natural Transformations.- 1. Axioms for Categories.- 2. Categories.- 3. Functors.- 4. Natural Transformations.- 5. Monics, Epis, and Zeros.- 6. Foundations.- 7. Large

A simple constructive computability theorem for wait-free computation

It is shown that a synchronization problem has a wait-free solution if and only if its input complex can be continuously “stretched and folded” to cover its output complex.