The homology graph of a precubical set (Q2444581): Difference between revisions

Precubical sets can be used to model concurrency, a \(n\)-cube representing the concurrent execution of \(n\) actions. The author introduces the homology graph of a precubical set. It is a directed graph whose nodes are the homology classes of the precubical set. He shows that the homology graph is invariant under weak morphisms that are homeomorphisms. Weak morphisms are very close to the notion of T-homotopy introduced in [\textit{P. Gaucher} and \textit{E. Goubault}, Homology Homotopy Appl. 5, No. 2, 39--82 (2003; Zbl 1030.68058)] in the setting of globular complexes and in [\textit{P. Gaucher}, Int. J. Math. Math. Sci. 2007, Article ID 87404, 20 p. (2007; Zbl 1149.55009); New York J. Math. 12, 319--348 (2006; Zbl 1109.55010); ibid. 12, 63--95 (2006; Zbl 1110.55011)] in the setting of flows.