Sylvain Sené

dblp:78/5277 · DBLP profile ↗
← Back
24ranked-venue papers
0as first author
10since 2021 · last 2025
0000-0001-9741-9622ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12 · 6 since 2021Artificial intelligence and machine learning · 8 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Dynamical stability of threshold networks over undirected signed graphs
Eric Goles Ch., Pedro Montealegre-Barba, Martín Ríos-Wilson, Sylvain Sené
Theor. Comput. Sci.4
2025 Foundations of block-parallel automata networks
Kévin Perrot, Sylvain Sené, Léah Tapin
Theor. Comput. Sci.2
2024 Asymptotic (a)Synchronism Sensitivity and Complexity of Elementary Cellular Automata
Isabel Donoso Leiva, Eric Goles Ch., Martín Ríos-Wilson, Sylvain Sené
LATIN (2)4
2024 Combinatorics of Block-Parallel Automata Networks
Kévin Perrot, Sylvain Sené, Léah Tapin
SOFSEM2
2023 Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit Dynamics
Pacôme Perrotin, Sylvain Sené
CiE2
2023 Preface
Enrico Formenti, Sylvain Sené, Guillaume Theyssier
Nat. Comput.2
2023 Representation of gene regulation networks by hypothesis logic-based Boolean systems
Pierre Siegel, Andrei Doncescu, Vincent Risch, Sylvain Sené
J. Supercomput.4
2021 Optimising Attractor Computation in Boolean Automata Networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
LATA3
2021 Complexity of Limit-Cycle Problems in Boolean Networks
Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené
SOFSEM4
2021 On Boolean Automata Networks (de)Composition
abstract
Boolean automata networks (BANs) are a generalisation of Boolean cellular automata. In such, any theorem describing the way BANs compute information is a strong tool that can be applied to a wide range of models of computation. In this paper we explore a way of working with BANs which involves adding external inputs to the base model (via modules), and more importantly, a way to link networks together using the above mentioned inputs (via wirings). Our aim is to develop a powerful formalism for BAN (de)composition. We formulate three results: the first one shows that our modules/wirings definition is complete; the second one uses modules/wirings to prove simulation results amongst BANs; the final one expresses the complexity of the relation between modularity and the dynamics of modules.
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Fundam. Informaticae3
2020 #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
Kévin Perrot, Sylvain Sené, Lucas Venturini
CiE2
2020 On the Complexity of Acyclic Modules in Automata Networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
TAMC3
2020 About block-parallel Boolean networks: a position paper
Jacques Demongeot, Sylvain Sené
Nat. Comput.2
2020 Preface
Enrico Formenti, Sylvain Sené
Nat. Comput.2
2020 Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks
Eric Goles Ch., Fabiola Lobos, Gonzalo A. Ruz, Sylvain Sené
Nat. Comput.4
2018 Reconstruction of Boolean Regulatory Models of Flower Development Exploiting an Evolution Strategy
abstract
One of the first popular applications of Boolean networks for gene regulatory networks corresponds to the Mendoza & Alvarez-Buylla network of flower development. In this paper, we consider this model and a reduced version to reconstruct synthetic threshold Boolean networks that have the same asymptotic behavior as these base models. For this, we employ an evolution strategy to search for neighboring solutions. We were able to find solutions with fewer edges as well as networks with more balanced distributions of basins of attractions. Overall, our results show the effectiveness of using evolutionary computation in this application to explore alternative solutions with desired properties.
Gonzalo A. Ruz, Eric Goles Ch., Sylvain Sené
CEC3
2018 A Framework for (De)composing with Boolean Automata Networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
MCU3
2018 Synchronism versus asynchronism in monotonic Boolean automata networks
Mathilde Noual, Sylvain Sené
Nat. Comput.2
2017 On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One
Florian Bridoux, Pierre Guillon 0001, Kévin Perrot, Sylvain Sené, Guillaume Theyssier
TAMC4
2013 About non-monotony in Boolean automata networks
Mathilde Noual, Damien Regnault, Sylvain Sené
Theor. Comput. Sci.3
2012 Combinatorics of Boolean automata circuits dynamics
Jacques Demongeot, Mathilde Noual, Sylvain Sené
Discret. Appl. Math.3
2008 Robustness of Dynamical Systems Attraction Basins Against State Perturbations: Theoretical Protocol and Application in Systems Biology
abstract
This paper aims at giving a general and precise method to achieve a good understanding of discrete dynamical systems by focusing on their attraction basins. This work is the result of a previous one which has permitted to show that the structural changes introduced by fixed boundary conditions on regulatory networks could directly and strongly influence the properties of their attraction basins. In this paper, we give an exhaustive stochastic study protocol to understand what happens on attraction basins of dynamical systems when the latter are subjected to state perturbations. Then, we give an application of this protocol by giving the results obtained on a specific system which is a model of the Arabidopsis thaliana flower’s morphogenesis, depending on a specific boundary condition.
Jacques Demongeot, Michel Morvan, Sylvain Sené
CISIS3
2008 Boundary conditions and phase transitions in neural networks. Theoretical results
Jacques Demongeot, Christelle Jézéquel, Sylvain Sené
Neural Networks3
2008 Boundary conditions and phase transitions in neural networks. Simulation results
Jacques Demongeot, Sylvain Sené
Neural Networks2