1 citations · 2 across the 8 of their papers we have counts for
6 papers · 1 filter
Period Piece: NEXPTIME-complete problems on digraphs via Boolean network dynamics
Florian Bridoux, Maximilien Gadouleau, David C. Kutner +1
The central object in this work is the Boolean network, a function . Often identified with is its dynamics , the digraph with exactly $\{x \to y…
Asynchronous dynamics of isomorphic Boolean networks
Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard
A Boolean network is a function from which several dynamics can be derived, depending on the context. The most classical ones are the synchronous and asyn…
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…
Complexity of limit-cycle problems in Boolean networks
Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot +1
Boolean networks are a general model of interacting entities, with applications to biological phenomena such as gene regulation. Attractors play a central role, and the schedule of…
Sequentialization and Procedural Complexity in Automata Networks
Florian Bridoux
In this article we consider finite automata networks (ANs) with two kinds of update schedules: the parallel one (all automata are updated all together) and the sequential ones (the…
On the cost of simulating a parallel Boolean automata network by a block-sequential one
Florian Bridoux, Pierre Guillon, Kévin Perrot +2
In this article we study the minimum number of additional automata that a Boolean automata network (BAN) associated with a given block-sequential update schedule needs in order…