Y. 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.
DOI : 10.1145/93385.93396

F. Baader and T. Nipkow, Term rewriting and all that. Cambridge university press, 1999.

F. Benavides and S. Rajsbaum, The read/write protocol complex is collapsible, Latin American Symposium on Theoretical Informatics, pp.179-191, 2016.

M. Bezem, J. W. Klop, and R. De-vrijer, Term rewriting systems, 2003.

O. Biran, S. Moran, and S. Zaks, A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor, 1988.

R. Bonichon, G. Canet, L. Correnson, É. Goubault, E. Haucourt et al., Rigorous evidence of freedom from concurrency faults in industrial control software, SAFECOMP, 2011.
URL : https://hal.archives-ouvertes.fr/cea-01809015

E. Borowsky and E. Gafni, Generalized FLP impossibility result for tresilient asynchronous computations, STOC, 1993.

A. Castañeda, S. Rajsbaum, and M. Raynal, Specifying concurrent problems: beyond linearizability and up to tasks, International Symposium on Distributed Computing, pp.420-435, 2015.

L. Fajstrup, É. Goubault, E. Haucourt, S. Mimram, and M. Raussen, Trace spaces: An efficient new technique for state-space reduction, ESOP, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00684615

L. Fajstrup, É. Goubault, E. Haucourt, S. Mimram, and M. Raussen, Directed Algebraic Topology and Concurrency, 2016.
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, TCS, vol.357, issue.1, 2006.
DOI : 10.1016/j.tcs.2006.03.022
URL : https://doi.org/10.1016/j.tcs.2006.03.022

M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM (JACM), vol.32, issue.2, pp.374-382, 1985.

P. C. 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

E. Gafni, Snapshot for time: the one-shot case, 2014.

G. Gierz, A Compendium of continuous lattices, 1980.

É. Goubault, The Geometry of Concurrency, 1995.

É. Goubault, Some geometric perspectives in concurrency theory. Homology, Homotopy and Appl, 2003.

É. Goubault and E. Haucourt, A practical application of geometric semantics to static analysis of concurrent programs, CONCUR 2005, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00150857

É. Goubault, T. Heindel, and S. Mimram, A geometric view of partial order reduction, MFPS, Electr. Notes Theor. Comput. Sci, vol.298, 2013.
URL : https://hal.archives-ouvertes.fr/cea-01836517

É. Goubault and T. P. Jensen, Homology of higher-dimensional automata, Proc. of CONCUR, 1992.

É. Goubault, S. Mimram, and C. Tasson, Iterated chromatic subdivisions are collapsible. Applied Categorical Structures, 2014.
URL : https://hal.archives-ouvertes.fr/cea-01822918

M. Grandis, Directed Algebraic Topology : Models of Non-Reversible Worlds, New Mathematical Monographs, vol.13, 2009.

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

M. Herlihy, D. Kozlov, and S. Rajsbaum, Distributed Computing Through Combinatorial Topology, 2014.

M. Herlihy and N. Shavit, The asynchronous computability theorem for t-resilient tasks, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp.111-120, 1993.

M. Herlihy and N. Shavit, The topological structure of asynchronous computability, Journal of the ACM (JACM), vol.46, issue.6, pp.858-923, 1999.

D. Kozlov, Chromatic subdivision of a simplicial complex, Homology, Homotopy and Appl, vol.14, issue.2, 2012.

D. Kozlov, Topology of the view complex, 2013.

N. A. Lynch, Distributed algorithms, 1996.

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

V. Pratt, Modeling concurrency with geometry, POPL, 1991.

M. E. Saks and F. Zaharoglou, Wait-free k-set agreement is impossible: the topology of public knowledge, STOC, 1993.

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