6 papers
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…
Synchronizing Boolean networks asynchronously
Julio Aracena, Adrien Richard, Lilian Salinas
The {\em asynchronous automaton} associated with a Boolean network , considered in many applications, is the finite deterministic automaton where the set o…
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…
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…
Number of fixed points and disjoint cycles in monotone Boolean networks
Julio Aracena, Adrien Richard, Lilian Salinas
Given a digraph , a lot of attention has been deserved on the maximum number of fixed points in a Boolean network with as interaction graph.…
Fixed points in conjunctive networks and maximal independent sets in graph contractions
Julio Aracena, Adrien Richard, Lilian Salinas
Given a graph , viewed as a loop-less symmetric digraph, we study the maximum number of fixed points in a conjunctive boolean network with as interaction graph. We prove tha…