pith. sign in

arxiv: 1011.6599 · v2 · pith:74UVWNYWnew · submitted 2010-11-30 · 💻 cs.DC · math.AT

Simplicial models for concurrency

classification 💻 cs.DC math.AT
keywords concurrentsimplicesanothercalculatedconcurrencyexecutionsformerlatter
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.