Minimal trap spaces of logical models are maximal siphons of their petri net encoding
VG Trinh, B Benhamou, K Hiraishi… - … on Computational Methods …, 2022 - Springer
Boolean modelling of gene regulation but also of post-transcriptomic systems has proven
over the years that it can bring powerful analyses and corresponding insight to the many …
over the years that it can bring powerful analyses and corresponding insight to the many …
Computational complexity of minimal trap spaces in Boolean networks
A Boolean network (BN) is a discrete dynamical system defined by a Boolean function that
maps to the domain itself. A trap space of a BN is a generalization of a fixed point, which is …
maps to the domain itself. A trap space of a BN is a generalization of a fixed point, which is …
Boolean networks: beyond generalized asynchronicity
Boolean networks are commonly used in systems biology to model dynamics of biochemical
networks by abstracting away many (and often unknown) parameters related to speed and …
networks by abstracting away many (and often unknown) parameters related to speed and …
Concurrency in Boolean networks
Boolean networks (BNs) are widely used to model the qualitative dynamics of biological
systems. Besides the logical rules determining the evolution of each component with respect …
systems. Besides the logical rules determining the evolution of each component with respect …
Trap spaces of multi-valued networks: definition, computation, and applications
Motivation Boolean networks are simple but efficient mathematical formalism for modelling
complex biological systems. However, having only two levels of activation is sometimes not …
complex biological systems. However, having only two levels of activation is sometimes not …
An FVS-based approach to attractor detection in asynchronous random Boolean networks
Boolean networks (BNs) play a crucial role in modeling and analyzing biological systems.
One of the central issues in the analysis of BNs is attractor detection, ie, identification of all …
One of the central issues in the analysis of BNs is attractor detection, ie, identification of all …
Formal analysis of qualitative long-term behaviour in parametrised boolean networks
Boolean networks offer an elegant way to model the behaviour of complex systems with
positive and negative feedback. The long-term behaviour of a Boolean network is …
positive and negative feedback. The long-term behaviour of a Boolean network is …
Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding
Boolean network modeling of gene regulation but also of post-transcriptomic systems has
proven over the years that it can bring powerful analyses and corresponding insight to the …
proven over the years that it can bring powerful analyses and corresponding insight to the …
Computing bottom SCCs symbolically using transition guided reduction
Detection of bottom strongly connected components (BSCC) in state-transition graphs is an
important problem with many applications, such as detecting recurrent states in Markov …
important problem with many applications, such as detecting recurrent states in Markov …
Goal-oriented reduction of automata networks
L Paulevé - International Conference on Computational Methods in …, 2016 - Springer
We consider networks of finite-state machines having local transitions conditioned by the
current state of other automata. In this paper, we introduce a reduction procedure tailored for …
current state of other automata. In this paper, we introduce a reduction procedure tailored for …