J. Aracena, On the robustness of update schedules in Boolean networks, Biosystems, vol.97, issue.1, pp.1-8, 2009.
DOI : 10.1016/j.biosystems.2009.03.006

H. L. Bodlaender and T. Kloks, Better algorithms for the pathwidth and treewidth of graphs, Proceedings of ICALP'91, pp.544-555, 1991.
DOI : 10.1007/3-540-54233-7_162

F. Bridoux, P. Guillon, K. Perrot, S. Sené, and G. Theyssier, On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One, Proceedings of TAMC'07, pp.112-128, 2017.
DOI : 10.1016/0022-5193(73)90247-6

M. Gadouleau and S. Riis, Memoryless computation: New results, constructions, and extensions, Theoretical Computer Science, vol.562, pp.129-145, 2015.
DOI : 10.1016/j.tcs.2014.09.040
URL : http://arxiv.org/pdf/1111.6026

E. Goles and S. Martínez, Neural and Automata Networks: Dynamical Behavior and Applications, 1990.
DOI : 10.1007/978-94-009-0529-0

E. Goles and L. Salinas, Comparison between parallel and serial dynamics of Boolean networks, Theoretical Computer Science, vol.396, issue.1-3, pp.247-253, 2008.
DOI : 10.1016/j.tcs.2007.09.008

M. Tchuente, Sequential simulation of parallel iterations and applications, Theoretical Computer Science, vol.48, pp.135-144, 1986.
DOI : 10.1016/0304-3975(86)90091-5

R. Thomas, Boolean formalization of genetic control circuits, Journal of Theoretical Biology, vol.42, issue.3, pp.563-585, 1973.
DOI : 10.1016/0022-5193(73)90247-6