Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A simple constructive computability theorem for wait-free computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Set consensus using arbitrary objects (preliminary version)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
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
Combinatorics of labelling in higher-dimensional automata
Theoretical Computer Science
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The strict globular ω-categories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) ω-category 𝒞 three homology theories. The first one is called the globular homology. It contains the oriented loops of 𝒞. The two other ones are called the negative (respectively, positive) corner homology. They contain in a certain manner the branching areas of execution paths or negative corners (respectively, the merging areas of execution paths or positive corners) of 𝒞. Two natural linear maps called the negative (respectively, the positive) Hurewicz morphism from the globular homology to the negative (respectively, positive) corner homology are constructed. We explain the reason why these constructions allow the reinterpretation of some geometric problems coming from computer science.