I will present 
the paper by P. Madhusudan and P.S. Thiagarajan: Effective Strategies for
Asynchronous Distributed Control.
Conference on Concurrency Theory (CONCUR 2002)}

<P>

Below  is its abstract
<P>
ABSTRACT
<P>
We study the problem of synthesizing controllers in a natural distributed
asynchronous setting: a finite set of {plants} interact with their local
environments and communicate with each other by synchronizing on common
actions. The controller-synthesis problem is to come up with a {\em
local\,}
strategy for each plant such that the controlled behaviour of the network
meets
a specification. We consider linear time specifications and provide, in
some
sense, a minimal set of restrictions under which this problem is
effectively
solvable:
We identify three restrictions: (R1) the specification should not
discriminate between ``causally equivalent'' interleavings, (R2) the
local
strategy can only remember lengths of local histories and (R3) the local
strategies enforce a fixed communication pattern.
we show that the
controller-synthesis problem under these restrictions is decidable while
the problem becomes undecidable if any one or more of these three
restrictions are
dropped.