Shortest Trajectories and Reversibility in Boolean Automata Networks
  The question this research report explores is the following: when does a shortest trajectory between two configurations, or between one configuration and an attractor need to change several times the state of one automaton? 
Mathilde Noual
cs.DM cs.FL