In this paper we study the evolution of asynchronous automata for the density task. We compare our results with those obtained
for synchronous automata and we describe the influence of various asynchronous update policies on the computational strategy.
We also investigate how synchronous and asynchronous cellular automata behave under noisy conditions and show that asynchronous
ones are more fault-tolerant.