Shortest Trajectories and Reversibility in Boolean Automata Networks
arXiv:1606.02613
Abstract
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?