Geometric
and
Topological Methods
in
Concurrency
 
 
 

 with kind support from

 


 
 


 

and hosted by 
 


 

Scope of the workshop

The main mathematical disciplines that have been used in computer science are discrete mathematics (especially, graph theory and ordered structures), logics (mostly proof theory for all kinds of logics, classical, intuitionistic, modal etc.) and category theory (cartesian closed categories, topoi etc.). General Topology has also been used for instance in denotational semantics, with relations to ordered structures in particular.

Recently, ideas and notions from mainstream "geometric" topology and algebraic topology have entered the scene in Concurrency Theory and Distributed Systems Theory (some of them based on older ideas). They have been applied in particular to problems dealing with coordination of multi-processor and distributed systems (see the  historical note ). Among those are techniques borrowed from algebraic and geometric topology: Simplicial techniques have led to new theoretical bounds for coordination problems. Higher dimensional automata have been modelled as cubical complexes with a partial order reflecting the time flows, and their homotopy properties allow to reason about a system's global behaviour.

The first workshop on the subject  Geometric and Topological Methods in Concurrency Theory  has been held in Aalborg, Denmark, in June 1999.

This workshop aims at bringing together researchers from both the mathematical (geometry, topology, algebraic topology etc.) and computer scientific side (concurrency theorists, semanticians, researchers in distributed systems etc.) with an active interest in these or related developments.

Topics include (but are not limited to) Semantics, Concurrency Theory, Model-checking, Abstract Interpretation, Fault-tolerant Protocols for Distributed Systems, Geometrical/Topological models, application of algebraic topology, category theory etc.

Programme

 
Monday 21 August
8:45 - 09:00
OPENING
9:00 - 10:00
  Tutorial: Topology and Directed Topology 
                    by Martin Raussen
10:00 - 10:15
COFFEE BREAK
10:15 - 11:15
  Tutorial: Geometry of Fault-Tolerant Distributed Systems  
                    by Maurice Herlihy
11:15 - 11:30
BREAK
11:30 - 12:00
   Concurrent Processes with Loops from a Geometric Viewpoint 
                    by Lisbeth Fajstrup and Stefan Sokolowski
12:00 - 12:30
  First Informal Discussion
12:30 - 14:00
LUNCH
14:00 - 14:30
  A Study on Semi-Sheaves Associated to Transition Systems 
                    by Ana Isabel de Azevedo Spinola and Edward Hermann Haeusler
14:30 - 15:00
  Synchronous Message-Passing and Topology 
                    by Maurice Herlihy, Mark Tuttle and Sergio Rajsbaum
15:00 - 15:15
COFFEE BREAK
15:15 - 15:45
  From Concurrency to Algebraic Topology 
                    by Philippe Gaucher
15:45 - 16:15
  Occurrence Counting Analysis for the pi-calculus 
                    by Jerome Feret
16:15 - 16:30
  BREAK
16:30 - 17:10
  Conclusion: Results, Perspectives and Open Problems 
                    by Eric Goubault
17:10 - 17:30
  Second Informal Discussion
 
 
 

 

Programme Committee

Important Dates

Local Organization

Contact Person

This web page will be updated periodically to take account of any developments. Additional information can be obtained directly from:
Eric Goubault
DEIN/SLA
CEA/Saclay
F91191 Gif-sur-Yvette 21st of August 2000
Phone: (+33) 1 69 08 94 72
Fax: (+33) 1 69 08 83 95
Email: Eric.Goubault@cea.fr

Registration

The registration for GETCO'2000 is made through the registration for Concur'2000 with no extra-charge.

Publication

First contacts have been taken with Electronic Notes in Theoretical Computer Science.