Algebraic topology and concurrency

  • Authors:

  • Lisbeth Fajstrup;Martin Raußen;Eric Goubault

  • Affiliations:

  • Department of Mathematical Sciences, Aalborg University, Aalborg Ø, Denmark;Department of Mathematical Sciences, Aalborg University, Aalborg Ø, Denmark;LIST (CEA-Technologies Avancées), DTSI-SLA, CEA, Gif-sur-Yvette Cedex, France

  • Venue:
  • Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show in this article that some concepts from homotopy theory, in algebraic topology, are relevant for studying concurrent programs. We exhibit a natural semantics of semaphore programs, based on partially ordered topological spaces, which are studied up to "elastic deformation" or homotopy, giving information about important properties of the program, such as deadlocks, unreachables, serializability, essential schedules, etc. In fact, it is not quite ordinary homotopy that has to be used, but rather a "directed homotopy" that does not reverse the flow of time. We show some of the essential differences between ordinary and directed homotopy through examples. We also relate the topological view to a combinatorial view of concurrent programs closer to transition systems, through the notion of a cubical set. Finally we apply some of these concepts to the proof of the safeness of a two-phase protocol, well-known and used in concurrent database theory. We end up with a list of problems from both a mathematical and a computer-scientific point of view.