  Population protocols are a formal model of sensor networks consisting of
identical mobile devices. Two devices can interact and thereby change their
states. Computations are infinite sequences of interactions in which the
interacting devices are chosen uniformly at random.
  In well designed population protocols, for every initial configuration of
devices, and for every computation starting at this configuration, all devices
eventually agree on a consensus value. We address the problem of automatically
computing a parametric bound on the expected time the protocol needs to reach
this consensus. We present the first algorithm that, when successful, outputs a
function f(n) such that the expected time to consensus is bound by O(f(n)),
where n is the number of devices executing the protocol. We experimentally show
that our algorithm terminates and provides good bounds for many of the
protocols found in the literature.
