×

On the conversion of multivalued to Boolean dynamics. (English) Zbl 1411.92123

Summary: Results and tools on discrete interaction networks are often concerned with Boolean variables, whereas considering more than two levels is sometimes useful. Multivalued networks can be converted to partial Boolean maps, in a way that preserves the asynchronous dynamics. We investigate the problem of extending these maps to non-admissible states, i.e. states that do not have a multivalued counterpart. We observe that attractors are preserved if a stepwise version of the original function is considered for conversion. Different extensions of the Boolean conversion affect the structure of the interaction graphs in different ways. A particular technique for extending the partial Boolean conversion is identified, that ensures that feedback cycles are preserved. This property, combined with the conservation of the asymptotic behaviour, can prove useful for the application of results and analyses defined in the Boolean setting to multivalued networks, and vice versa. As a first application, by considering the conversion of a known example for the discrete multivalued case, we create a Boolean map showing that the existence of a cyclic attractor and the absence of fixed points are compatible with the absence of local negative cycles. We then state a multivalued version of a result connecting mirror states and local feedback cycles.

MSC:

92C42 Systems biology, networks
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
05C90 Applications of graph theory

Software:

multi2boolean
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Chaouiya, C.; Naldi, A.; Remy, E.; Thieffry, D., Petri net representation of multi-valued logical regulatory graphs, Nat. Comput., 10, 2, 727-750 (2011) · Zbl 1217.68149
[2] Didier, G.; Remy, E.; Chaouiya, C., Mapping multivalued onto Boolean dynamics, J. Theoret. Biol., 270, 1, 177-184 (2011) · Zbl 1331.92051
[3] Fauré, A.; Kaji, S., A circuit-preserving mapping from multilevel to Boolean dynamics, J. Theoret. Biol., 440, 71-79 (2018) · Zbl 1400.92208
[4] Glass, L.; Kauffman, S. A., The logical analysis of continuous, non-linear biochemical control networks, J. Theor. Biol., 39, 1, 103-129 (1973)
[5] Remy, É.; Ruet, P.; Thieffry, D., Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework, Adv. Appl. Math., 41, 3, 335-350 (2008) · Zbl 1169.05333
[6] Richard, A., An extension of a combinatorial fixed point theorem of Shih and Dong, Adv. Appl. Math., 41, 4, 620-627 (2008) · Zbl 1185.05027
[7] Richard, A., Negative circuits and sustained oscillations in asynchronous automata networks, Adv. Appl. Math., 44, 4, 378-392 (2010) · Zbl 1201.37117
[8] Richard, A.; Comet, J.-P., Necessary conditions for multistationarity in discrete dynamical systems, Discrete Appl. Math., 155, 18, 2403-2413 (2007) · Zbl 1125.37062
[9] Ruet, P., Local cycles and dynamical properties of Boolean networks, Math. Struct. Comput. Sci., 26, 04, 702-718 (2016) · Zbl 1373.37035
[10] Ruet, P., Negative local feedbacks in Boolean networks, Discrete Appl. Math., 221, 1-17 (2017) · Zbl 1357.05141
[11] Shih, M.-H.; Dong, J.-L., A combinatorial analogue of the Jacobian problem in automata networks, Adv. Appl. Math., 34, 1, 30-46 (2005) · Zbl 1060.05505
[12] Thomas, R., Boolean formalization of genetic control circuits, J. Theoret. Biol., 42, 3, 563-585 (1973)
[13] Thomas, R., On the relation between the logical structure of systems and their ability to generate multiple steady states or sustained oscillations, (Numerical Methods in the Study of Critical Phenomena (1981), Springer), 180-193 · Zbl 0489.92025
[14] Thomas, R., Regulatory networks seen as asynchronous automata: a logical description, J. Theoret. Biol., 153, 1, 1-23 (1991)
[15] Van Ham, P., How to deal with variables with more than two levels, (Kinetic Logic a Boolean Approach to the Analysis of Complex Regulatory Systems (1979), Springer), 326-343
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.