# Quantification of reachable attractors in asynchronous discrete dynamics

@article{Mendes2014QuantificationOR, title={Quantification of reachable attractors in asynchronous discrete dynamics}, author={Nuno D. Mendes and Pedro T. Monteiro and Jorge Carneiro and {\'E}lisabeth Remy and Claudine Chaouiya}, journal={ArXiv}, year={2014}, volume={abs/1411.3539} }

Motivation: Models of discrete concurrent systems often lead to huge and complex state transition graphs that represent their dynamics. This makes difficult to analyse dynamical properties. In particular, for logical models of biological regulatory networks, it is of real interest to study attractors and their reachability from specific initial conditions, i.e. to assess the potential asymptotical behaviours of the system. Beyond the identification of the reachable attractors, we propose to…

## 8 Citations

### Logical Modeling and Dynamical Analysis of Cellular Networks

- Biology, Computer ScienceFront. Genet.
- 2016

A number of recent methodological advances to ease the analysis of large and intricate networks are reviewed, including approaches to determine model attractors and their reachability properties, to assess the dynamical impact of variations of external signals, and to consistently reduce large models.

### Conceptual and computational framework for logical modelling of biological networks deregulated in diseases

- Computer ScienceBriefings Bioinform.
- 2019

A pipeline of computational tools that performs a series of analyses to explore a logical model's properties and how the solutions of a mathematical model can also be compared with experimental data, with a particular focus on high-throughput data in cancer biology.

### Determining Relative Dynamic Stability of Cell States Using Boolean Network Model

- BiologyScientific Reports
- 2018

A new method based on one-degree neighborhood, which is the simplest one and agrees with other methods to estimate the cellular stability in all scenarios of the EMT model is proposed.

### Logical modelling and analysis of cellular regulatory networks with GINsim 3.0

- Computer SciencebioRxiv
- 2018

This tutorial guides the reader step by step towards the definition, the analysis and the simulation of a four-node model of the mammalian p53-Mdm2 network.

### A Modeling Approach to Explain Mutually Exclusive and Co-Occurring Genetic Alterations in Bladder Tumorigenesis.

- BiologyCancer research
- 2015

Overall, this work shows how to predict combinations of the major gene alterations leading to invasiveness through two main progression pathways in bladder cancer.

### MicroRNA-16 feedback loop with p53 and Wip1 can regulate cell fate determination between apoptosis and senescence in DNA damage response

- BiologyPloS one
- 2017

A logical model of the G1/S checkpoint in DNA damage response that takes into account different levels of damage and contemplates the influence of miR-16 through its positive feedback loop formed with p53 and Wip1 finds good agreement between the level of DNA damage and the probability of the phenotype produced according to experiments.

### Modeling the role of microRNA-449a in the regulation of the G2/M cell cycle checkpoint in prostate LNCaP cells under ionizing radiation

- BiologyPloS one
- 2018

A boolean model of the G2/M checkpoint arrest regulation contemplating the influence of miR-449a shows that the cell fate determination between two cellular phenotypes: G2-M-Arrest for DNA repair and G1/M-induced apoptosis is stochastic and influenced by miR -449a state of activation.

### Logical Modeling and Analysis of Cellular Regulatory Networks With GINsim 3.0

- Computer ScienceFront. Physiol.
- 2018

This tutorial guides the reader step by step toward the definition, the analysis and the simulation of a four-node model of the mammalian p53-Mdm2 network.

## References

SHOWING 1-10 OF 20 REFERENCES

### Logical and symbolic analysis of robust biological dynamics.

- Computer ScienceCurrent opinion in genetics & development
- 2010

### An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks.

- Computer ScienceChaos
- 2013

This work presents a novel network reduction approach that is based on finding network motifs that stabilize in a fixed state that can actually predict the dynamical repertoire of the nodes (fixed states or oscillations) in the attractors of the system.

### Continuous time boolean modeling for biological signaling: application of Gillespie algorithm

- Computer Science, BiologyBMC Systems Biology
- 2012

An algorithm for modeling biological networks in a discrete framework with continuous time based on continuous time Markov process applied on a Boolean state space, which allows to describe kinetic phenomena which were difficult to handle in the original models.

### Sliding Window Abstraction for Infinite Markov Chains

- Computer Science, MathematicsCAV
- 2009

An on-the-fly abstraction technique for infinite-state continuous -time Markov chains that are specified by a finite set of transition classes, which approximate the transient probability distributions at various time instances by solving a sequence of dynamically constructed abstract models.

### Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle

- Computer ScienceISMB
- 2006

This work compares the respective advantages and limits of synchronous versus asynchronous updating assumptions to delineate the asymptotical behaviour of regulatory networks and proposes several intermediate strategies to optimize the computation of asymPTotical properties depending on available knowledge.

### Discrete dynamic modeling of signal transduction networks.

- BiologyMethods in molecular biology
- 2012

This chapter is to give a detailed description of Boolean modeling, the simplest type of discrete dynamic modeling, and the ways in which it can be applied to analyze the dynamics of signaling networks.

### BoolNet - an R package for generation, reconstruction and analysis of Boolean networks

- Computer ScienceBioinform.
- 2010

BoolNet efficiently integrates methods for synchronous, asynchronous and probabilistic BNs, and includes reconstructing networks from time series, generating random networks, robustness analysis via perturbation, Markov chain simulations, and identification and visualization of attractors.

### The finite state projection algorithm for the solution of the chemical master equation.

- Computer ScienceThe Journal of chemical physics
- 2006

The FSP is utilized to solve two examples taken from the field of systems biology, and comparisons are made between the FSP, the SSA, and tau leaping algorithms.

### Markov chains and mixing times

- Mathematics
- 2013

For our purposes, a Markov chain is a (finite or countable) collection of states S and transition probabilities pij, where i, j ∈ S. We write P = [pij] for the matrix of transition probabilities.…

### Diversity and Plasticity of Th Cell Types Predicted from Regulatory Network Modelling

- BiologyPLoS Comput. Biol.
- 2010

This paper proposes an integrated, comprehensive model of the regulatory network and signalling pathways controlling Th cell differentiation and highlights the nature of these cell types and their relationships with canonical Th subtypes.