**Thomas Kahl**

*CMAT, Universidade do Minho*

It has been discovered relatively recently that concepts and methods from algebraic topology may be employed profitably in concurrency theory, the field of computer science that studies systems of simultaneously executing processes. A very expressive combinatorial-topological model of concurrency is given by higher-dimensional automata, i.e., labeled precubical sets. The cubical homology of an HDA may be equipped with a labeling in the exterior algebra on its alphabet. In this talk, I will introduce this labeled homology and illustrate how it may be used to extract information from HDAs that is meaningful from a computer science point of view.