Algebraic topology and concurrency

DOI10.1016/j.tcs.2006.03.022zbMath1099.55003MaRDI QIDQ2500494

Eric Goubault, Martin Raussen, Lisbeth Fajstrup

Publication date: 16 August 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.022

zbMATH Keywords

concurrency; higher-dimensional automata; cubical set; deadlock; directed homotopy; local partial order

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

55P99: Homotopy theory

68Q99: Theory of computing

Related Items

Cubical local partial orders on cubically subdivided spaces -- existence and construction, Deadlocks and dihomotopy in mutual exclusion models, Geometric analysis of nondeterminacy in dynamical systems, Trace spaces in a pre-cubical complex, Higher fundamental groupoids for spaces, Components of the fundamental category. II, Invariants of directed spaces, Dipaths and dihomotopies in a cubical complex, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete rewriting systems and homology of monoid algebras
• Concurrent transition systems
• On the algebra of cubes
• Colimit theorems for relative homotopy groups
• The Anick resolution
• A finiteness condition for rewriting systems
• Dicovering spaces
• Topological deformation of higher dimensional automata
• Some geometric perspectives in concurrency theory
• State spaces and dipaths up to dihomotopy
• Components of the fundamental category
• On the expressiveness of higher dimensional automata
• Dipaths and dihomotopies in a cubical complex
• Homologie singulière des espaces fibrés. Applications
• A simple constructive computability theorem for wait-free computation
• Renaming in an asynchronous environment
• The geometry of semaphore programs
• Impossibility of distributed consensus with one faulty process
• A Correctness Condition for High-Performance Multiprocessors
• Robust wait-free hierarchies
• On the classification of dipaths in geometric models for concurrency
• Homotopy invariants of higher dimensional categories and concurrency in computer science
• Investigation of concurrent processes by means of homotopy functors
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Generalized FLP impossibility result for t-resilient asynchronous computations
• The asynchronous computability theorem for t-resilient tasks
• On the robustness of Herlihy's hierarchy
• Set consensus using arbitrary objects (preliminary version)
• Algebraic spans
• Extraction of concurrent processes from higher dimensional automata