TL;DR
This paper introduces a novel approach to modeling concurrent programs and their execution paths using simplicial complexes, providing a geometric perspective on concurrency.
Contribution
It presents a new simplicial modeling framework for concurrent programs and their executions, utilizing necklaces of simplices to analyze possible state transitions.
Findings
Provides a geometric representation of concurrency.
Enables analysis of execution paths using simplicial structures.
Introduces necklaces of simplices for modeling transitions.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.