  We compare several definitions for number-conserving cellular automata that
we prove to be equivalent. A necessary and sufficient condition for \cas to be
number-conserving is proved. Using this condition, we give a linear-time
algorithm to decide number-conservation. The dynamical behavior of
number-conserving \cas is studied and a classification that focuses on
chaoticity is given.
