TY - GEN A1 - Klarner, Hannes A1 - Bockmayr, Alexander A1 - Siebert, Heike T1 - Computing Symbolic Steady States of Boolean Networks N2 - Asymptotic behavior is often of particular interest when analyzing asynchronous Boolean networks representing biological systems such as signal transduction or gene regulatory networks. Methods based on a generalization of the steady state notion, the so-called symbolic steady states, can be exploited to investigate attractor properties as well as for model reduction techniques conserving attractors. In this paper, we propose a novel optimization-based method for computing all maximal symbolic steady states and motivate their use. In particular, we add a new result yielding a lower bound for the number of cyclic attractors and illustrate the methods with a short study of a MAPK pathway model. KW - biological network KW - Boolean network KW - discrete dynamical system KW - prime implicand Y1 - 2014 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/1282 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-12823 ER -