3 papers
cs.DM2022
Complexity of limit cycles with block-sequential update schedules in conjunctive networks
Julio Aracena, Florian Bridoux, Luis Gómez +1
In this paper, we deal the following decision problem: given a conjunctive Boolean network defined by its interaction digraph, does it have a limit cycle of a given length k? We pr…
cs.DM2020
Finding the fixed points of a Boolean network from a positive feedback vertex set
Julio Aracena, Luis Cabreras-Crot, Lilian Salinas
In the modeling of biological systems by Boolean networks a key problem is finding the set of fixed points of a given network. Some constructed algorithms consider certain structur…
math.CO2018
Fixing monotone Boolean networks asynchronously
Julio Aracena, Maximilien Gadouleau, Adrien Richard +1
The asynchronous automaton associated with a Boolean network is considered in many applications. It is the finite deterministic automaton with set of stat…