Simplicial models for concurrency

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.Comment: 12 pages, Section 4 from v1 omitted since quasi-category equivalences are too strong: they induce equivalences of path categorie