R. 1. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt et al., Atomic snapshots of shared memory, J. ACM, vol.40, issue.4, 1993.

J. H. Anderson, Composite registers, Conference on Principles of Distributed Computing, 1993.

O. Biran, S. Moran, and S. Zaks, A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, 1988.
DOI : 10.1145/62546.62590

R. Bonichon, G. Canet, L. Correnson, É. Goubault, E. Haucourt et al., Rigorous Evidence of Freedom from Concurrency Faults in Industrial Control Software, SAFECOMP, 2011.
DOI : 10.1007/978-3-540-69611-7_16

E. Borowsky and E. Gafni, -resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, 1993.
DOI : 10.1145/167088.167119
URL : https://hal.archives-ouvertes.fr/hal-00896459

J. Dubut, E. Goubault, and J. Goubault-larrecq, Natural Homology, Automata, Languages, and Programming -42nd International Colloquium, pp.171-183, 2015.
DOI : 10.1007/978-3-662-47666-6_14

L. Fajstrup, É. Goubault, E. Haucourt, S. Mimram, and M. Raussen, Trace Spaces: An Efficient New Technique for State-Space Reduction, ESOP, 2012.
DOI : 10.1007/978-3-642-28869-2_14
URL : https://hal.archives-ouvertes.fr/hal-00684615

L. Fajstrup, É. Goubault, E. Haucourt, S. Mimram, and M. Raussen, Directed Algebraic Topology and Concurrency, 2015.
DOI : 10.1007/978-3-319-15398-8

L. Fajstrup, É. Goubault, and M. Raussen, Detecting deadlocks in concurrent systems, CONCUR, number 1466 in LNCS, 1998.

L. Fajstrup, M. Raussen, and É. Goubault, Algebraic topology and concurrency, Theoretical Computer Science, vol.357, issue.1-3, 2006.
DOI : 10.1016/j.tcs.2006.03.022
URL : http://doi.org/10.1016/j.tcs.2006.03.022

M. J. Fischer, N. Lynch, and M. S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121

P. Fishburn, Intransitive indifference with unequal indifference intervals, Journal of Mathematical Psychology, vol.7, issue.1, pp.144-149, 1970.
DOI : 10.1016/0022-2496(70)90062-3

G. Gierz, A Compendium of continuous lattices, 1980.
DOI : 10.1007/978-3-642-67678-9

É. Goubault, Some geometric perspectives in concurrency theory, Homology, Homotopy and Applications, vol.5, issue.2, 2003.
DOI : 10.4310/HHA.2003.v5.n2.a5

É. Goubault and E. Haucourt, A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs, CONCUR 2005, 2005.
DOI : 10.1007/11539452_38
URL : https://hal.archives-ouvertes.fr/hal-00150857

É. Goubault, T. Heindel, and S. Mimram, A Geometric View of Partial Order Reduction, Electronic Notes in Theoretical Computer Science, vol.298, 2013.
DOI : 10.1016/j.entcs.2013.09.013

É. Goubault and T. P. Jensen, Homology of higher dimensional automata, Proc. of CONCUR, 1992.
DOI : 10.1007/BFb0084796

É. Goubault, The Geometry of Concurrency, 1995.

É. Goubault, S. Mimram, and C. Tasson, Iterated chromatic subdivisions are collapsible APplied Categorical Structures, 2014.

M. Grandis, Directed Algebraic Topology : Models of Non-Reversible Worlds, volume 13 of New Mathematical Monographs, 2009.
DOI : 10.1017/CBO9780511657474

J. Gunawardena, Homotopy and concurrency, Bulletin of the EATCS, vol.54, pp.184-193, 1994.

M. Herlihy and N. Shavit, -resilient tasks, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.111-120, 1993.
DOI : 10.1145/167088.167125
URL : https://hal.archives-ouvertes.fr/hal-01248204

M. Herlihy and N. Shavit, The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999.
DOI : 10.1145/331524.331529

D. Kozlov, Chromatic subdivision of a simplicial complex. Homology, Homotopy and Appl, p.2012

D. Kozlov, Topology of the view complex, Homology, Homotopy and Applications, vol.17, issue.1, 2013.
DOI : 10.4310/HHA.2015.v17.n1.a15

M. C. Loui and H. H. Abu-amara, Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research, vol.4, 1987.

N. A. Lynch, Distributed algorithms, 1996.

L. Nachbin, Topology and order. Van Nostrand mathematical studies, 1965.

V. Pratt, Modeling concurrency with geometry, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, 1991.
DOI : 10.1145/99583.99625

M. E. Saks and F. Zaharoglou, -set agreement is impossible, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, 1993.
DOI : 10.1145/167088.167122
URL : https://hal.archives-ouvertes.fr/hal-00192526

R. Van-glabbeek, Bisimulation semantics for higher dimensional automata, 1991.