@inproceedings{993341cc8f9e4c80958269e0d79a157f,
title = "Of the Complexity of Boolean Network State Trajectories",
abstract = "We study the complexity of network dynamics in a couple of very different model classes: The traditional random Boolean networks (RBN) and Frisch-Hasslacher-Pomeau lattice gas automata (FHP). For this we formulate the FHP dynamics as a probabilistic Boolean network (PBN). We use the set complexity of successive network states to assess the complexity of the dynamics. We find that the complexity is maximised near a transition state in both types of dynamical systems.",
author = "Tuomo M{\"a}ki-Marttunen and Juha Kesseli and Stuart Kauffman and Olli Yli-Harja and Matti Nykter",
note = "ei ut-numeroa 5.4.2014<br/>Contribution: organisation=sgn,FACT1=1",
year = "2011",
language = "English",
isbn = "978-952-15-2591-9",
series = "International Workshop on Computational Systems Biology WCSB",
publisher = "WCSB 2011",
number = "57",
pages = "137--140",
editor = "Heinz Koeppl and Jugoslava Acimovic and Juha Kesseli and Tuomo M{\"a}ki-Marttunen and Antti Larjo and Olli Yli-Harja",
booktitle = "Eight International Workshop on Computational Systems Biology, WCSB 2011, June 6-8, Zurich, Switzerland. TICSP series",
}