Re: Algebraic Topology and Distributed Computing

From: Jamie Andrews; real address _at_ bottom of message (me_at_privacy.net)
Date: 12/14/03 

Date: 14 Dec 2003 22:21:27 GMT

In comp.theory Michael N. Christoff <mchristoff@sympatico.caremovethis> wrote:
> Algebraic toplogy (AT herein) seems to be a good way of formalizing
> protocols in distributed systems (DS herein) (such as decision problems like
> 'consensus').

     Do you know about Petri nets, process algebras such as
CCS, CSP and the Pi-calculus, and more abstract
characterizations such as labelled transition systems (LTSs)?
If not, those would be important to know before plunging into
topology. There is even a widely-accepted language (LOTOS)
based on CCS and CSP that is used for formally defining
communication protocols. Moreover PROMELA, the language for
protocol definition which is used by the SPIN model checker, is
also based partly on CSP and is also widely used.

     There may be some reason why these more standard formal
characterizations are not adequate for your purposes, but in the
absence of other information, I would say to try them first.

--Jamie. (nel mezzo del cammin di nostra vita)
  andrews .uwo } Merge these two lines to obtain my e-mail address.
         @csd .ca } (Unsolicited "bulk" e-mail costs everyone.)