. Y. Bibliography, H. Afek, D. Attiya, E. Dolev, M. Gafni et al., Atomic snapshots of shared memory, J. ACM, vol.40, issue.4, pp.873-890, 1993.

[. Ara and F. Métayer, The Brown-Golasi?ski model structure on strict ?-groupoids revisited. Homology, Homotopy and Applications, pp.121-142, 2011.

C. Angiuli, E. Morehouse, D. R. Licata, and R. Harper, Homotopical patch theory, Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, pp.243-256, 2014.
DOI : 10.1145/2692915.2628158

URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=3671&context=compsci

]. J. And93 and . Anderson, Composite registers, Conference on Principles of Distributed Computing, pp.15-30, 1993.

J. [. Adámek and . Rosicky, Locally presentable and accessible categories, 1994.
DOI : 10.1017/CBO9780511600579

]. M. Bat98a and . Batanin, Computads for finitary monads on globular sets, Contemporary Mathematics, vol.230, pp.37-58, 1998.

]. M. Bat98b and . Batanin, Monoidal Globular Categories As a Natural Environment for the Theory of Weak n-Categories, Advances in Mathematics, vol.136, issue.1, pp.39-103, 1998.

. Bbc-+-97-]-b, S. Barras, C. Boutin, J. Cornes, J. Courant et al., The Coq proof assistant reference manual: Version 6, 1997.

R. [. Baelde, S. Beauxis, and . Mimram, Liquidsoap: A High-Level Programming??Language for Multimedia??Streaming, SOFSEM 2011: Theory and Practice of Computer Science, pp.99-110, 2011.
DOI : 10.1007/978-3-540-74141-1_30

URL : https://hal.archives-ouvertes.fr/inria-00585728

A. [. Bednarczyk, W. Borzyszkowski, and . Pawlowski, Generalized Congruences ? Epimorphisms in Cat, Theory and Applications of Categories, vol.5, issue.11, pp.266-280, 1999.

. Bcc-+-11-]-r, G. Bonichon, L. Canet, É. Correnson, E. Goubault et al., Rigorous Evidence of Freedom from Concurrency Faults in Industrial Control Software, SAFECOMP, pp.85-98, 2011.

]. K. Bck-+-15, K. Bar, A. Casey, J. Kissinger, C. Vicary et al., HySon: Set-based simulation of hybrid systems, Rapid System Prototyping (RSP), 2012 23rd IEEE International Symposium on, pp.79-85, 2012.

A. [. Bouissou, S. Chapoutot, and . Mimram, Set-based Simulation for Design and Verification of Simulink Models, Embedded Real Time Software and Systems (ERTS), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01290286

[. Betti, A. Carboni, R. Street, and R. Walters, Variation through enrichment, Journal of Pure and Applied Algebra, vol.29, issue.2, pp.109-127, 1983.
DOI : 10.1016/0022-4049(83)90100-7

URL : https://doi.org/10.1016/0022-4049(83)90100-7

]. M. Bed88 and . Bednarczyk, Categories of asynchronous systems, 1988.

E. [. Borowsky and . Gafni, -resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, 1993.
DOI : 10.1145/167088.167119

A. [. Bridson and . Haefliger, Metric spaces of non-positive curvature, 2009.
DOI : 10.1007/978-3-662-12494-9

E. [. Balabonski and . Haucourt, A Geometric Approach to the Problem of Unique Decomposition of Processes, Concurrency Theory 21th International Conference, pp.132-146, 2010.
DOI : 10.1007/978-3-642-15375-4_10

URL : https://hal.archives-ouvertes.fr/hal-00527878

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

S. [. Baelde and . Mimram, De la webradio lambda à la ?-webradio, JFLA (Journées Francophones des Langages Applicatifs), pp.47-62, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00202813

S. [. Beauxis and . Mimram, A Non-Standard Semantics for Kahn Networks in Continuous Time Computer Science Logic (CSL'11) -25th International Workshop, 20th Annual Conference of the EACSL of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.35-50, 2011.

S. [. Biran, S. Moran, and . 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, pp.263-275, 1988.
DOI : 10.1145/62546.62590

T. [. Baader and . Nipkow, Term Rewriting and All That, 1999.

]. F. Bor94, . Borceux, S. Benavides, and . Rajsbaum, Handbook of Categorical Algebra 1. Basic Category Theory. Encyclopedia of Mathematics and its Applications The read/write protocol complex is collapsible. arXiv preprint, 1994.

]. K. Bro87 and . Brown, Finiteness Properties of Groups, Journal of Pure and Applied Algebra, vol.44, issue.1, pp.45-75, 1987.

K. [. Brieskorn and . Saito, Artin-Gruppen und Coxeter-Gruppen, Inventiones Mathematicae, vol.I, issue.4, pp.245-271, 1972.
DOI : 10.1007/BF01406235

]. A. Bur93 and . Burroni, Higher-dimensional word problems with applications to equational logic. Theoretical computer science, pp.43-62, 1993.

]. A. Bur12 and . Burroni, Automates et grammaires polygraphiques, Diagrammes, vol.67, pp.9-32, 2012.

K. [. Bubenik and . Worytkiewicz, A Model Category for Local PO-Spaces. Homology , Homotopy and Applications, pp.263-292, 2006.

M. J. Cassaigne, F. Espie, D. F. Hivert, J. Krob, and . Novelli, THE CHINESE MONOID, International Journal of Algebra and Computation, vol.109, issue.03, pp.301-334, 2001.
DOI : 10.1007/BFb0090012

URL : https://hal.archives-ouvertes.fr/hal-00018547

R. [. Cain, A. Gray, and . Malheiro, Finite Gröbner?Shirshov bases for plactic algebras and biautomatic structures for plactic monoids, pp.16-2012

]. S. Cha90 and . Chaudhuri, Agreement is harder than consensus: set consensus problems in totally asynchronous systems, Proc. of the 9th Annual ACM Symposium on Principles of Distributed Computing, pp.311-334, 1990.

]. E. Che12 and . Cheng, A direct proof that the category of 3-computads is not cartesian closed, 2012.

]. E. Cla09 and . Clarke, My 27-year quest to overcome the state explosion problem, Logic In Computer Science, 2009. LICS '09. 24th Annual IEEE Symposium on, pp.3-3, 2009.

S. [. Clerc and . Mimram, Presenting a Category Modulo a Rewriting System

]. D. Coh92 and . Cohen, A monoid which is right F P ? but not left F P 1, Bulletin of the London Mathematical Society, vol.24, issue.4, pp.340-342, 1992.

]. S. Cra95 and . Crans, Pasting schemes for the monoidal biclosed structure on ?-cat, 1995.

]. B. Day70 and . Day, On closed categories of functors, Reports of the Midwest Category Seminar IV, pp.1-38, 1970.

. Ddg-+-15-]-p, F. Dehornoy, E. Digne, D. Godelle, J. Krammer et al., of EMS tracts in mathematics, Foundations of Garside theory, 2015.

]. P. Del72 and . Deligne, Les immeubles des groupes de tresses généralisés, Invent. Math, vol.17, pp.273-302, 1972.

]. P. Del97 and . Deligne, Action du groupe des tresses sur une catégorie, Invent. Math, vol.128, issue.1, pp.159-175, 1997.

É. [. Dubut, J. Goubault, ]. E. Goubault-larrecqdij68a, and . Dijkstra, Natural homology Cooperating sequential processes, Automata , Languages, and Programming -42nd International Colloquium Proceedings, Part II Programming Languages: NATO Advanced Study Institute, pp.171-183, 1968.

]. E. Dij68b and . Dijkstra, The Structure of the THE Operating System, Communications of the ACM, vol.11, issue.15, pp.341-436, 1968.

D. [. Duchamp and . Krob, Plactic-growth-like monoids, Words, languages and combinatorics, II (Kyoto, 1992), pp.124-142, 1994.

Y. [. Diekert and . Métivier, Partial Commutation and Traces, Handbook of formal languages, pp.457-533, 1997.
DOI : 10.1007/978-3-642-59126-6_8

URL : https://hal.archives-ouvertes.fr/hal-00307048

]. A. Dow09 and . Downey, The Little Book of SEMAPHORES (2nd Edition): The Ins and Outs of Concurrency Control and Common Mistakes, 2009.

G. [. Diekert and . Rozenberg, The Book of Traces, World Scientific, 1995.
DOI : 10.1142/2563

]. M. Dro90 and . Droste, Concurrency, automata and domains, Automata, Languages and Programming, pp.195-208, 1990.

R. [. Droste and . Shortt, Petri nets and automata with concurrency relations?an adjunction, Sem. of Prog. Lang. and Model Theory, pp.69-87, 1993.

]. S. Eil41 and . Eilenberg, Ordered Topological Spaces, American Journal of Mathematics, vol.63, pp.39-45, 1941.

J. Engelfriet, Branching processes of Petri nets, Acta Informatica, vol.4, issue.6, pp.575-591, 1991.
DOI : 10.1007/3-540-17906-2_31

]. U. Fah05 and . Fahrenberg, Higher-Dimensional Automata from a Topological Viewpoint, 2005.

]. L. Faj03 and . Fajstrup, Dicovering spaces. Homology, Homotopy and Applications, pp.1-17, 2003.

]. L. Faj05 and . Fajstrup, Dipaths and dihomotopies in a cubical complex, Advances in Applied Mathematics, vol.35, issue.2, pp.188-206, 2005.

]. L. Faj11 and . Fajstrup, Erratum to 'Dicovering spaces'. Homology, Homotopy and Applications, pp.403-406, 2011.

]. L. Faj14 and . Fajstrup, Trace spaces of directed tori with rectangular holes, Mathematical Structures in Computer Science, vol.24, issue.02, p.240202, 2014.

. Fgh-+-12-]-l, É. Fajstrup, E. Goubault, S. Haucourt, M. Mimram et al., Trace Spaces: An Efficient New Technique for State-Space Reduction, ESOP, pp.274-294, 2012.

L. Fajstrup, É. Goubault, E. Haucourt, and M. Raussen, Components of the Fundamental Category Applied Categorical Structures, FGR98] L. Fajstrup, É. Goubault, and M. Raussen. Detecting Deadlocks in Concurrent Systems. CONCUR'98 Concurrency Theory, pp.81-108, 1998.

]. P. Fis70 and . Fishburn, Intransitive indifference with unequal indifference intervals, Journal of Mathematical Psychology, vol.7, issue.1, pp.144-149, 1970.

A. [. Fahrenberg and . Legay, History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps, Electronic Notes in Theoretical Computer Science, vol.298, pp.165-178, 2013.
DOI : 10.1016/j.entcs.2013.09.012

URL : https://hal.archives-ouvertes.fr/hal-01087917

A. [. Fahrenberg and . Legay, Homotopy bisimilarity for higher-dimensional automata . arXiv preprint, 2014.
DOI : 10.1016/j.entcs.2013.09.012

URL : https://hal.archives-ouvertes.fr/hal-01087294

N. [. Fischer, M. S. Lynch, and . Paterson, Impossibility of distributed consensus with one faulty process A convenient category for directed homotopy, Journal of the ACM Theory and Applications of Categories, vol.32, issue.211, pp.374-3827, 1985.

M. [. Fajstrup, É. Raussen, and . Goubault, Algebraic topology and concurrency, Theoretical Computer Science, vol.357, issue.1-3, pp.241-278, 2006.
DOI : 10.1016/j.tcs.2006.03.022

URL : https://doi.org/10.1016/j.tcs.2006.03.022

]. F. Gar69 and . Garside, The braid group and other groups, Quart. J. Math. Oxford Ser, vol.20, pp.235-254, 1969.

]. P. Gau03 and . Gaucher, A model category for the homotopy theory of concurrency. Homology, Homotopy and Applications, pp.549-599, 2003.

]. P. Gau05 and . Gaucher, Homological properties of non-deterministic branchings of mergings in higher dimensional automata. Homology, Homotopy and Applications, pp.51-76, 2005.

]. P. Gau06 and . Gaucher, Inverting weak dihomotopy equivalence using homotopy continuous flow, Theory and Applications of Categories, vol.16, issue.3, pp.59-83, 2006.

]. P. Gau08 and . Gaucher, Towards a homotopy theory of process algebra. Homology, Homotopy and Applications, pp.353-388, 2008.

]. P. Gau10 and . Gaucher, Directed algebraic topology and higher dimensional transition systems, New-York Journal of Mathematics, 2010.

]. P. Gau11 and . Gaucher, Towards a homotopy theory of higher dimensional transition systems, Theory and Applications of Categories, vol.25, issue.12, pp.295-341, 2011.

]. P. Gau14a and . Gaucher, Erratum to " towards a homotopy theory of higher dimensional transition systems, Theory and Applications of Categories, vol.29, issue.2, pp.17-20, 2014.

P. Gaucher, Homotopy theory of labelled symmetric precubical sets, New York Journal of Mathematics, vol.20, pp.93-131, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01076930

É. [. Gaucher and . Goubault, Topological deformation of higher dimensional automata. Homology, Homotopy and Applications, pp.39-82, 2003.

S. Gaussent, Y. Guiraud, and P. Malbos, Coherent presentations of Artin monoids, Compositio Mathematica, vol.22, issue.05, pp.957-998, 2015.
DOI : 10.1090/pspum/056.2/1278735

URL : https://hal.archives-ouvertes.fr/hal-00682233

E. [. Goubault and . Haucourt, A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs, Proceedings of CONCUR'05 Goubault and E. Haucourt. Components of the Fundamental Category II. Applied Categorical Structures, pp.503-517387, 2005.
DOI : 10.1007/11539452_38

URL : https://hal.archives-ouvertes.fr/hal-00150857

E. [. Goubault, S. Haucourt, . [. Krishnan, E. Goubault, S. Haucourt et al., Covering Space Theory for the Directed Topology Theory and Applications of Categories Future path-components in directed topology, MFPS, pp.252-268, 2009.

É. Goubault, T. Heindel, and S. Mimram, A Geometric View of Partial Order Reduction, Proceedings of Mathematical Foundations of Programming Semantics, pp.179-195, 2013.
DOI : 10.1016/j.entcs.2013.09.013

T. [. Goubault and . Jensen, Homology of higher dimensional automata, Proc. of CONCUR'92, 1992.
DOI : 10.1007/BFb0084796

J. [. Goerss and . Jardine, Simplicial homotopy theory, 2009.

. [. Goubault-larrecq, Non-Hausdorff Topology and Domain Theory: Selected Topics in Point-Set Topology Grandis and L. Mauri. Cubical sets and their site, Theory Appl. Categ, vol.22, issue.8, pp.11185-211, 2003.
DOI : 10.1017/CBO9781139524438

P. [. Guiraud and . Malbos, Higher-dimensional categories with finite derivation type, Theory Appl. Categ, vol.22, issue.18, pp.420-478, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00326974

]. É. Gm12a, S. Goubault, and . Mimram, Formal relationships between geometrical and classical models for concurrency, Electronic Notes in Theoretical Computer Science, vol.283, pp.77-109, 2012.

]. Y. Gm12b, P. Guiraud, and . Malbos, Coherence in monoidal track categories, Math. Structures Comput. Sci, vol.22, issue.6, pp.931-969, 2012.

]. Y. Gm12c, P. Guiraud, and . Malbos, Higher-dimensional normalisation strategies for acyclicity, Advances in Mathematics, vol.231, issue.3, pp.2294-2351, 2012.

P. [. Guiraud and . Malbos, Identities among relations for higher-dimensional rewriting systems, Semin. Congr, vol.26, pp.145-161, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00426228

P. [. Guiraud and . Malbos, Polygraphs of finite derivation type. arXiv preprint, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00932845

. Gmm-+-13-]-y, P. Guiraud, S. Malbos, and . Mimram, A homotopical completion procedure with applications to coherence of monoids, RTA-24th International Conference on Rewriting Techniques and Applications-2013, pp.223-238, 2013.

É. Goubault, S. Mimram, and C. Tasson, Iterated Chromatic Subdivisions are Collapsible, Applied Categorical Structures, vol.2, issue.1, pp.1-42, 2014.
DOI : 10.1112/plms/s2-45.1.243

URL : http://www.pps.univ-paris-diderot.fr/~smimram/docs/mimram_subdivision.pdf

É. Goubault, S. Mimram, and C. Tasson, From Geometric Semantics to Asynchronous Computability, Proc. of DISC 2015, 2015.
DOI : 10.1007/978-3-662-48653-5_29

URL : https://hal.archives-ouvertes.fr/hal-01207146

É. Goubault, S. Mimram, and C. Tasson, Geometric and combinatorial views on asynchronous computability, Distributed Computing, vol.14, issue.2, 2016.
DOI : 10.1145/99583.99625

]. P. God96 and . Godefroid, Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem, Lecture Notes in Computer Science, vol.1032, 1996.

]. É. Gou95 and . Goubault, The Geometry of Concurrency, 1995.

]. É. Gou96a and . Goubault, Durations for truly-concurrent actions, Proceedings of ESOP'96, number 1058, pp.173-187, 1996.

]. É. Gou96b and . Goubault, The dynamics of wait-free distributed computations, 1996.

]. É. Gou96c and . Goubault, A semantic view on distributed computability and complexity, Proceedings of the 3rd Theory and Formal Methods Section Workshop, 1996.

]. É. Gou97 and . Goubault, Optimal implementation of wait-free binary relations, Proceedings of the 22nd CAAP, 1997.

]. É. Gou01 and . Goubault, Labelled cubical sets and asynchronous transistion systems: an adjunction, Presented at CMCIM'02, p.2002, 2001.

]. É. Gou03 and . Goubault, Some Geometric Perspectives in Concurrency Theory. Homology, Homotopy and Applications, 2003.

M. [. Goubault and . Raussen, Dihomotopy as a Tool in State Space Analysis Tutorial, Proceedings of LATIN'02, pp.16-37, 2002.
DOI : 10.1007/3-540-45995-2_8

]. M. Gra03 and . Grandis, Directed Homotopy Theory, I. The Fundamental Category, Cahiers de Topologie et Géométrie Différentielle Catégoriques Inequilogical spaces, directed homology and noncommutative geometry . Homology, Homotopy and Applications, pp.281-316413, 2003.

]. M. Gra05 and . Grandis, The shape of a category up to directed homotopy, Theory Appl. Categ, vol.15, issue.4, pp.95-146, 2005.

]. M. Gra09 and . Grandis, Directed Algebraic Topology : Models of Non-Reversible Worlds, volume 13 of New Mathematical Monographs Hyperbolic groups, 1987.

]. T. Gro13 and . Group, Base Specifications, POSIX.1, Présentations d'opérades et systèmes de réécriture, 2004.

]. Y. Gui06 and . Guiraud, Termination orders for 3-dimensional rewriting, Journal of Pure and Applied Algebra, vol.207, issue.2, pp.341-371, 2006.

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

M. [. Gabriel and . Zisman, Calculus of fractions and homotopy theory, 1967.
DOI : 10.1007/978-3-642-85844-4

. [. Haucourt, See http://www.lix. polytechnique.fr/alcool/. [Hag14] N. Hage. Finite convergent presentation for the plactic monoid for type C. arXiv preprint, 2014.

]. A. Hat02 and . Hatcher, Algebraic topology, 2002.

]. E. Hau05a and . Haucourt, A framework for component categories, ENTCS, 2005.

]. E. Hau05b and . Haucourt, Topologie Algébrique Dirigé et Concurrence, 2005.

]. E. Hau06 and . Haucourt, Categories of Components and Loop-free Categories, Theory and Applications of Categories, vol.16, issue.27, pp.736-770, 2006.

]. E. Hau12 and . Haucourt, Streams, d-spaces and their fundamental categories, Electronic Notes in Theoretical Computer Science, vol.283, pp.111-151, 2012.

]. C. Hoa78 and . Hoare, Communicating sequential processes, Commun. ACM, vol.21, issue.8, pp.666-677, 1978.

]. G. Hol04 and . Holzmann, The SPIN model checker: Primer and reference manual, 2004.

]. R. Hou12 and . Houston, On editing text, 2012.

]. R. Hou14, . Houston, and . Revisiting, On editing text, 2014.

N. [. Herlihy and . 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

V. [. Hildebrandt and . Sassone, Comparing transition systems with independence and asynchronous transition systems, 1996.
DOI : 10.1007/3-540-61604-7_49

URL : https://eprints.soton.ac.uk/261955/1/tsi-ats.pdf

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

]. G. Hue80 and . Huet, Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems, Journal of the ACM (JACM), vol.27, issue.4, pp.797-821, 1980.

G. [. Hayman and . Winskel, The unfolding of general petri nets, FSTTCS, pp.223-234, 2008.

]. J. Jac09 and . Jacobson, A formalization of darcs patch theory using inverse semigroups, 2009.

]. T. Kah13 and . Kahl, The homology graph of a higher dimensional automaton, 2013.

P. [. Knuth and . Bendix, Simple Word Problems in Universal Algebras, Computational Problems in Abstract Algebra (Proc. Conf, pp.263-297, 1967.
DOI : 10.1007/978-3-642-81955-1_23

]. M. Kel82 and . Kelly, Basic concepts of enriched category theory, 1982.

P. [. Kapur and . Narendran, A finite thue system with decidable word problem and without equivalent finite canonical system, Theoretical Computer Science, vol.35, issue.2- 3, pp.337-344, 1985.
DOI : 10.1016/0304-3975(85)90023-4

]. D. Knu70 and . Knuth, Permutations, matrices, and generalized young tableaux, Pacific J. Math, vol.34, issue.3, pp.709-727, 1970.

]. D. Koz08 and . Kozlov, Combinatorial algebraic topology, 2008.

]. D. Koz12 and . Kozlov, Chromatic subdivision of a simplicial complex. Homology, Homotopy and Applications, pp.197-209, 2012.

]. D. Koz15 and . Kozlov, Topology of the view complex. Homology, Homotopy and Applications, pp.307-319, 2015.

]. S. Kri09 and . Krishnan, A Convenient Category of Locally Preordered Spaces Applied Categorical Structures, pp.445-466, 2009.

]. S. Kri13 and . Krishnan, Cubical approximation for directed topology I. Applied Categorical Structures, pp.1-38, 2013.

H. [. Loui and . Abu-amara, Memory requirements for agreement among unreliable asynchronous processes Advances in Computing Research [Laf95] Y. Lafont. A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) Towards an algebraic theory of boolean circuits, J. Pure Appl. Algebra Journal of Pure and Applied Algebra, vol.4, issue.1842, pp.229-244257, 1987.

]. L. Lam79, . W. Lamportlaw73-]-f, and . Lawvere, How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs Metric spaces, generalized logic, and closed categories, Rendiconti del seminario matématico e fisico di Milano, pp.690-691135, 1973.

]. T. Lei04 and . Leinster, Higher Operads, Higher Categories. Number 298 in London Mathmatics Society Lecture Note Series, 2004.

]. P. Les84 and . Lescanne, Term rewriting systems and algebra, 7th International Conference on Automated Deduction, pp.166-174, 1984.

]. Lév78 and . Lévy, Réductions correctes et optimales dans le lambda-calcul, 1978.

]. P. Lit96 and . Littelmann, A plactic algebra for semisimple Lie algebras, Adv. Math, vol.124, issue.2, pp.312-331, 1996.

F. [. Lafont and . Métayer, Polygraphic resolutions and homology of monoids, Journal of Pure and Applied Algebra, vol.213, issue.6, pp.947-968, 2009.
DOI : 10.1016/j.jpaa.2008.10.005

URL : https://hal.archives-ouvertes.fr/hal-00148370

F. [. Lafont, K. Métayer, and . Worytkiewicz, A folk model structure on omega-cat, Advances in Mathematics, vol.224, issue.3, pp.1183-1231, 2010.
DOI : 10.1016/j.aim.2010.01.007

URL : https://hal.archives-ouvertes.fr/hal-00194231

C. [. Lipski and . Papadimitriou, A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems, Journal of Algorithms, vol.2, issue.3, 1981.
DOI : 10.1016/0196-6774(81)90023-7

M. [. Lascoux and . Schützenberger, Le monoïde plaxique In Noncommutative structures in algebra and geometric combinatorics (Naples, 1978), volume 109 of Quad, Ricerca Sci. CNR, pp.129-156, 1981.

]. N. Lyn96 and . Lynch, Distributed algorithms, 1996.

]. S. Mac98 and . Lane, Categories for the Working Mathematician, Graduate Texts in Mathematics, vol.5, 1998.

]. A. Maz88 and . Mazurkiewicz, Basic notions of trace theory, Lecture Notes In Computer Science, vol.354, pp.285-363, 1988.

]. Mel04 and . Melliès, Asynchronous games 2: the true concurrency of innocence, Proceedings of the 15th CONCUR, number 3170 in LNCS, pp.448-465, 2004.

]. Y. Mét83 and . Métivier, About the rewriting systems produced by the knuth-bendix completion algorithm, Information Processing Letters, vol.16, issue.1, pp.31-34, 1983.

]. F. Mét03 and . Métayer, Resolutions by polygraphs, Theory and Applications of Categories, vol.11, issue.7, pp.148-184, 2003.

C. [. Mimram and X. Giusto, A Categorical Theory of Patches, Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, pp.283-307, 2013.
DOI : 10.1016/j.entcs.2013.09.018

URL : https://hal.archives-ouvertes.fr/hal-00904156

É. [. Mimram and . Goubault, Directed Homotopy in Non-Positively Curved Spaces, Journal article in preparation, 2016.

]. R. Mil89 and . Milner, Communication and concurrency, 1989.

]. S. Mim08 and . Mimram, Sémantique des jeux asynchrones et réécriture 2-dimensionnelle, 2008.

]. S. Mim10a and . Mimram, Computing Critical Pairs in 2-Dimensional Rewriting Systems, LIPIcs, vol.6, pp.227-242, 2010.

S. Mimram, Focusing in Asynchronous Games, CIE'10, 2010.
DOI : 10.1007/978-3-642-13962-8_37

URL : https://hal.archives-ouvertes.fr/inria-00473967

]. S. Mim11 and . Mimram, The structure of first-order causality, Mathematical Structures in Computer Science, vol.21, issue.01, pp.65-110, 2011.

]. S. Mim14 and . Mimram, Towards 3-Dimensional Rewriting Theory, Logical Methods in Computer Science, vol.10, issue.2, pp.1-47, 2014.

]. S. Mim15 and . Mimram, Presenting finite posets Static analysis of run-time errors in embedded critical parallel C programs, Proceedings 8th International Workshop on Computing with Terms and GraphsMin11] A. Miné Proc. of the 20th European Symposium on Programming (ESOP'11), volume 6602 of Lecture Notes in Computer Science (LNCS), pp.1-17, 2014.

[. Lane and I. Moerdijk, Sheaves in geometry and logic: A first introduction to topos theory, 1992.

[. Melliès and S. Mimram, Asynchronous Games: Innocence Without Alternation, Proceedings of the 18th International Conference on Concurrency Theory CONCUR, pp.395-411
DOI : 10.1007/978-3-540-74407-8_27

J. Meseguer, U. Montanari, and V. Sassone, On the semantics of place/transition Petri nets, Mor05] R. Morin. Concurrent automata vs. asynchronous systems, pp.359-397, 1997.
DOI : 10.1017/S0960129597002314

]. M. Muk92 and . Mukund, Petri nets and step transition systems, International Journal of Foundations of Computer Science, vol.3, issue.4, pp.443-478, 1992.

]. P. Mul94 and . Mulry, Lifting theorems for Kleisli categories, Mathematical Foundations of Programming Semantics, pp.304-319, 1994.

M. [. Makkai and . Zawadowski, 3-computads do not form a presheaf category, 2001.
DOI : 10.1016/j.jpaa.2008.04.010

URL : https://doi.org/10.1016/j.jpaa.2008.04.010

M. H. Newman, On Theories with a Combinatorial Definition of "Equivalence", The Annals of Mathematics, vol.43, issue.2, pp.223-243, 1942.
DOI : 10.2307/1968867

M. Nielsen, G. D. Plotkin, and G. Winskel, Petri nets, event structures and domains, Semantics of Concurrent Computation, pp.266-284, 1979.
DOI : 10.1007/BFb0022474

M. Nielsen, G. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.
DOI : 10.1016/0304-3975(81)90112-2

URL : https://doi.org/10.1016/0304-3975(81)90112-2

V. [. Nielsen, G. Sassone, and . Winskel, Relationships between models of concurrency, 1994.
DOI : 10.1007/3-540-58043-3_25

]. V. Oos94 and . Oostrom, Confluence by decreasing diagrams. Theoretical computer science, pp.259-280, 1994.

]. C. Pap83 and . Papadimitriou, Concurrency control by locking, SIAM Journal on Computing, vol.12, issue.2, pp.215-226, 1983.

]. R. Par73 and . Paré, Connected components and colimits, Journal of Pure and Applied Algebra, vol.3, issue.1, pp.21-42, 1973.

]. J. Ped89 and . Pedersen, Morphocompletion for one-relation monoids, RTA, pp.574-578, 1989.

]. D. Pel93 and . Peled, All from one, one for all: on model checking using representatives, Computer Aided Verification, pp.409-423, 1993.

]. C. Pet66 and . Petri, Communication with automata, 1966.

]. J. Pow91 and . Power, An n-categorical pasting theorem, Category theory, pp.326-358, 1991.

]. V. Pra91 and . Pratt, Modeling Concurrency with Geometry, Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pp.311-322, 1991.

. [. Roundy, The Darcs Theory, 2013.

]. M. Rau10 and . Raussen, Simplicial models of trace spaces, Alg. & Geom. Top, vol.10, pp.1683-1714, 2010.

]. M. Rau12a and . Raussen, Execution spaces for simple higher dimensional automata, Appl. Algebra Engrg. Comm. Comput, vol.23, pp.59-84, 2012.

]. M. Rau12b and . Raussen, Simplicial models for trace spaces II: General Higher-Dimensional Automata, Algebr. Geom. Topol, vol.12, issue.3, pp.1745-1765, 2012.

D. [. Ressel, R. Nitsche-ruhland, and . Gunzenhäuser, An integrating, transformation-oriented approach to concurrency control and undo in group editors, Proceedings of the 1996 ACM conference on Computer supported cooperative work , CSCW '96, pp.288-297179, 1961.
DOI : 10.1145/240080.240305

]. M. Shi85 and . Shields, Concurrent Machines, The Computer Journal, vol.28, issue.5, pp.449-465, 1985.

]. C. Sim94 and . Sims, Computation with finitely presented groups, 1994.

M. [. Sassone, G. Nielsen, and . Winskel, Relationships between models of concurrency, Proceedings of the Rex'93 school and symposium, 1994.

M. [. Sassone, G. Nielsen, and . Winskel, Models for concurrency: towards a classification, Theoretical Computer Science, vol.170, issue.1-2, pp.297-348, 1996.
DOI : 10.1016/S0304-3975(96)80710-9

F. [. Squier, Y. Otto, and . Kobayashi, A finiteness condition for rewriting systems, Theoretical Computer Science, vol.131, issue.2, pp.271-294, 1994.
DOI : 10.1016/0304-3975(94)90175-9

]. R. Sor47 and . Sorgenfrey, On the topological product of paracompact spaces, Bulletin of the American Mathematical Society, vol.53, issue.6, pp.631-632, 1947.

]. C. Squ87 and . Squier, Word problems and a homological finiteness condition for monoids, J. Pure Appl. Algebra, vol.49, issue.12, pp.201-217, 1987.

]. A. Sta89 and . Stark, Concurrent transition systems, Theoretical Computer Science, vol.64, pp.221-269, 1989.

]. E. Sta90 and . Stark, Connections between a concrete and an abstract model of concurrent systems, Mathematical Foundations of programming semantics, pp.53-79, 1990.

]. R. Str76 and . Street, Limits indexed by category-valued 2-functors, Journal of Pure and Applied Algebra, vol.8, issue.2, pp.149-181, 1976.

]. R. Str98 and . Street, The role of michael batanin's monoidal globular categories, Contemporary Mathematics, vol.230, pp.99-116, 1998.

R. [. Street and . Walters, The comprehensive factorization of a functor, Bulletin of the American Mathematical Society, vol.79, issue.5, pp.936-941, 1973.
DOI : 10.1090/S0002-9904-1973-13268-9

F. [. Saks and . 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

]. A. Thu14 and . Thue, Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln, Skrifter utg. av Videnskapsselsk. i Kristiania. 1. Matem.-naturv. Klasse, 1914.

]. H. Tie08 and . Tietze, Über die topologischen Invarianten mehrdimensionaler Mannigfaltigkeiten, Monatsh. Math. Phys, vol.19, issue.1, pp.1-118, 1908.

]. J. Tit81 and . Tits, A local approach to buildings, The geometric vein, pp.519-547, 1981.

]. A. Val89 and . Valmari, Stubborn sets for reduced state space generation, Applications and Theory of Petri NetsvG91] R. van Glabbeek. bisimulations for higher dimensional automata. E-mail, pp.491-515, 1989.

R. Van-glabbeek, Petri nets, configuration structures and higher dimensional automata. Lecture notes in computer science, vG06] R. van Glabbeek. On the expressiveness of higher dimensional automata. Theoretical computer science, pp.21-27265, 1999.

]. J. Whi39 and . Whitehead, Simplicial spaces, nuclei and m-groups, Proceedings of the London mathematical society, pp.243-327, 1939.

]. J. Whi50 and . Whitehead, Simple homotopy types, American Journal of Mathematics, pp.1-57, 1950.

]. G. Win86 and . Winskel, Event structures The formal semantics of programming languages: an introduction, Advances in Petri Nets, pp.325-392, 1986.

M. [. Winskel and . Nielsen, Models for concurrency, Handbook of logic in computer science, pp.1-148, 1995.
DOI : 10.7146/dpb.v21i429.6743

C. [. Yannakakis, H. T. Papadimitriou, and . Kung, Locking policies: Safety and freedom from deadlock, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.286-297, 1979.
DOI : 10.1109/SFCS.1979.22

]. I. Yud15 and . Yudin, Decreasing diagrams and coherent presentations. arXiv preprint, 2015.

]. W. Zie87 and . Zielonka, Notes on finite asynchronous automata, Informatique théorique et applications, pp.99-135, 1987.

]. K. Zie15 and . Ziemia?ski, On execution spaces of PV-programs, 2015.