Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Investigation of concurrent processes by means of homotopy functors
Mathematical Structures in Computer Science
On the classification of dipaths in geometric models for concurrency
Mathematical Structures in Computer Science
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
Enriched categories and models for spaces of evolving states
Theoretical Computer Science
Comparing Topological Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Relationships Between Geometrical and Classical Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In Fajstrup et al. (1998a) the authors proposed a fast algorithm for deadlock detection, which was based on a geometric model of concurrency. We propose here an extension of this approach to deal with recursive processes (loops) and branchings.