Estimating Attractor Reachability in Asynchronous Logical Models

Nuno Mendes (1) , Rui Henriques (2, 3) , Elisabeth Rémy (4) , Jorge Carneiro (1) , Pedro Monteiro (2, 3) , Claudine Chaouiya (1)

1 IGC - Instituto Gulbenkian de Ciência [Oeiras]
2 Université de Lisbonne
3 INESC-ID - Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento em Lisboa
4 I2M - Institut de Mathématiques de Marseille

Logical models are well-suited to capture salient dynamical properties of regulatory networks. For networks controlling cell fate decisions, cell fates are associated with model attractors (stable states or cyclic attractors) whose identification and reachability properties are particularly relevant. While synchronous updates assume unlikely instantaneous or identical rates associated with component changes, the consideration of asynchronous updates is more realistic but, for large models, may hinder the analysis of the resulting non-deterministic concurrent dynamics. This complexity hampers the study of asymptotical behaviors, and most existing approaches suffer from efficiency bottlenecks, being generally unable to handle cyclical attractors and quantify attractor reachability. Here, we propose two algorithms providing probability estimates of attractor reachability in asynchronous dynamics. The first algorithm, named Firefront, exhaustively explores the state space from an initial state, and provides quasi-exact evaluations of the reachability probabilities of model attractors. The algorithm progresses in breadth, propagating the probabilities of each encountered state to its successors. Second, Avatar is an adapted Monte Carlo approach, better suited for models with large and intertwined transient and terminal cycles. Avatar iteratively explores the state space by randomly selecting trajectories and by using these random walks to estimate the likelihood of reaching an attractor. Unlike Monte Carlo simulations, Avatar is equipped to avoid getting trapped in transient cycles and to identify cyclic attractors. Firefront and Avatar are validated and compared to related methods, using as test cases logical models of synthetic and biological networks. Both algorithms are implemented as new functionalities of GINsim 3.0, a well-established software tool for logical modeling, providing executable GUI, Java API, and scripting facilities.

Mots clés: regulatory network; logical modeling; discrete asynchronous dynamics; attractors; reachability

Domaines: Mathématiques [math]

Nuno Mendes, Rui Henriques, Elisabeth Rémy, Jorge Carneiro, Pedro Monteiro, et al.. Estimating Attractor Reachability in Asynchronous Logical Models. Frontiers in Physiology, 2018, 9, pp.1161. ⟨10.3389/fphys.2018.01161⟩. ⟨hal-02075322⟩