Computational geometry: an introduction
Computational geometry: an introduction
The geometry of semaphore programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Loops, ditopology and deadlocks
Mathematical Structures in Computer Science
Dihomotopy as a Tool in State Space Analysis
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
Deadlocks and dihomotopy in mutual exclusion models
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Formal Relationships Between Geometrical and Classical Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper focusses on the determination of the dihomotopy classes of dipaths in cubical complexes, representing the essentially different computations in a given concurrent program due to different schedules. Several new notions have to be developed, for example, the domains of dependence (Definition 2.4), which are borrowed from relativity theory (Penrose 1972). However, it turns out that the algorithm determining deadlocks and unsafe regions described in Fajstrup et al. (1998a; 1998b) can be modified and applied to do the essential calculational work.