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 …

Computational complexity of minimal trap spaces in Boolean networks

K Moon, K Lee, L Paulevé - SIAM Journal on Discrete Mathematics, 2024 - SIAM
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 …

Boolean networks: beyond generalized asynchronicity

T Chatain, S Haar, L Paulevé - … and Discrete Complex Systems: 24th IFIP …, 2018 - Springer
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 …

Concurrency in Boolean networks

T Chatain, S Haar, J Kolčák, L Paulevé, A Thakkar - Natural Computing, 2020 - Springer
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 …

Trap spaces of multi-valued networks: definition, computation, and applications

VG Trinh, B Benhamou, T Henzinger, S Pastva - Bioinformatics, 2023 - academic.oup.com
Motivation Boolean networks are simple but efficient mathematical formalism for modelling
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

T Van Giang, T Akutsu, K Hiraishi - IEEE/ACM Transactions on …, 2020 - ieeexplore.ieee.org
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 …

Formal analysis of qualitative long-term behaviour in parametrised boolean networks

N Beneš, L Brim, S Pastva, J Poláček… - Formal Methods and …, 2019 - Springer
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 …

Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding

VG Trinh, B Benhamou, S Soliman - Theoretical Computer Science, 2023 - Elsevier
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 …

Computing bottom SCCs symbolically using transition guided reduction

N Beneš, L Brim, S Pastva, D Šafránek - … , CAV 2021, Virtual Event, July 20 …, 2021 - Springer
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 …

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 …