Amenability and linear cellular automata over semisimple modules of finite length