Simplicial Models for Concurrency

Authors:
Peter Bubenik
Affiliations:
Department of Mathematics, Cleveland State University, Cleveland, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2012

Citing 1
Cited 0

Algebraic topology and concurrency

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics

Quantified Score

Hi-index	0.00

Visualization

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.