Abstract homotopical methods for theoretical computer science
arXiv:0707.1449
Abstract
The purpose of this paper is to collect the homotopical methods used in the development of the theory of flows initialized by author's paper ``A model category for the homotopy theory of concurrency''. It is presented generalizations of the classical Whitehead theorem inverting weak homotopy equivalences between CW-complexes using weak factorization systems. It is also presented methods of calculation of homotopy limits and homotopy colimits using Quillen adjunctions and Reedy categories.
16 pages; LaTeX2e; chapter of book
References in corpus (9)
- Higher Topos Theory
- Sheafifiable homotopy model categories
- Homological properties of non-deterministic branchings and mergings in higher dimensional automata
- Comparing globular complex and flow
- Flow does not model flows up to weak dihomotopy
- T-homotopy and refinement of observation (IV) : Invariance of the underlying homotopy type
- Inverting weak dihomotopy equivalence using homotopy continuous flow
- Concurrent Process up to Homotopy (I)
- T-homotopy and refinement of observation (II) : Adding new T-homotopy equivalences