Simplicial models for concurrency
Distributed, Parallel, and Cluster Computing
2012-06-13 v2 Algebraic Topology
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.
Keywords
Cite
@article{arxiv.1011.6599,
title = {Simplicial models for concurrency},
author = {Peter Bubenik},
journal= {arXiv preprint arXiv:1011.6599},
year = {2012}
}
Comments
12 pages, Section 4 from v1 omitted since quasi-category equivalences are too strong: they induce equivalences of path categories