| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422510 | Electronic Notes in Theoretical Computer Science | 2012 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
