  This article contains an overview of the results of the author in a field of
algebraic topology used in computer science. The relationship between the
cubical homology groups of generalized tori and homology groups of partial
trace monoid actions is described. Algorithms for computing the homology groups
of asynchronous systems, Petri nets, and Mazurkiewicz trace languages are
shown.
