Showing 2022Show all
2 papers · 1 filter
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…
math.CO2022
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…