Before revision:  Such networks are predominantly governed by nested canalizing functions . Derrida values are frequently used to analyze the robustness of a Boolean network to perturbations. This paper introduces closed formulas for the calculation of Derrida values of networks governed by Boolean nested canalizing functions, which previously required extensive simulations.
After revision:  Such networks are predominantly governed by nested canalizing functions (NCFs), first introduced in the Boolean context by S. Kauffman. After giving a general definition of NCFs we analyze the class of such functions. We derive a formula for the normalized average c-sensitivities of multistate NCFs, which enables the calculation of Derrida values of networks governed by Boolean nested canalizing functions, which previously required extensive simulations.