Simplicial models for concurrency
arXiv:1011.6599 · doi:10.1016/j.entcs.2012.05.002
Abstract
We model both concurrent programs and the possible executions from one state to another in a concurrent program using simplices. The latter are calculated using necklaces of simplices in the former.
12 pages, Section 4 from v1 omitted since quasi-category equivalences are too strong: they induce equivalences of path categories