Stefan Haar

Stefan Haar

Auto-generated profile, based on publicly available information

Stefan Haar

INRIA

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 August 2020 in Nature Communications
Verified
Journal Article
Open access
PDF file
LPLoïc Paulevé
Loïc Paulevé
JKJuraj Kolčák
Juraj Kolčák
TCThomas Chatain
Thomas Chatain
SHStefan Haar
Stefan Haar
Predicting biological systems’ behaviors requires taking into account many molecular and genetic elements for which limited information is available past a global knowledge of their pairwise interactions. Logical modeling, notably with Boolean Networks (BNs), is a well-established approach that enables reasoning on the qualitative dynamics of networks. Several dynamical interpretations of BNs have been proposed. The synchronous and (fully) asynchronous ones are the most prominent, where the value of either all or only one component can change at each step. Here we prove that, besides being costly to analyze, these usual interpretations can preclude the prediction of certain behaviors observed in quantitative systems. We introduce an execution paradigm, the Most Permissive Boolean Networks (MPBNs), which offers the formal guarantee not to miss any behavior achievable by a quantitative model following the same logic. Moreover, MPBNs significantly reduce the complexity of dynamical analysis, enabling to model genome-scale networks.

6 July 2018 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
BÉBérard
Bérard
BÉBéatrice
Béatrice
SHStefan Haar
Stefan Haar
SSSylvain Schmitz
Sylvain Schmitz
SSStefan Schwoon
Stefan Schwoon
Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues. We first relate different notions of diagnosability and opacity. We consider in pa

2 May 2019 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
HMHugues Mandon
Hugues Mandon
CSCui Su
Cui Su
Jun PangJun Pang
Jun Pang
SPSoumya Paul
Soumya Paul
SHStefan Haar
Stefan Haar
LPLoïc Paulevé
Loïc Paulevé
Cellular reprogramming, a technique that opens huge opportunities in modern and regenerative medicine, heavily relies on identifying key genes to perturb. Most of the existing computational methods for controlling which attractor (steady state) the cell will reach focus on finding mutations to apply to the initial state. However, it has been shown, and is proved in this article, that waiting between perturbations so that the update dynamics of the system prepares the ground, allows for new reprogramming strategies. To identify such sequential perturbations, we consider a qualitative model of regulatory networks, and rely on Binary Decision Diagrams to model their dynamics and the putative perturbations. Our method establishes a set identification of sequential perturbations, whether permanent (mutations) or only temporary, to achieve the existential or inevitable reachability of an arbitrary state of the system. We apply an implementation for temporary perturbations on models from the literature, illustrating that we are able to derive sequential perturbations to achieve trans-differentiation.

1 July 2013 in Theoretical Computer Science
Verified
Journal Article
Closed access
SHStefan Haar
Stefan Haar
CKChristian Kern
Christian Kern
SSStefan Schwoon
Stefan Schwoon

16 March 2012 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
SBSandie Balaguer
Sandie Balaguer
TCThomas Chatain
Thomas Chatain
SHStefan Haar
Stefan Haar

5 November 2014 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Closed access
PDF file
HLHernán Ponce De León
Hernán Ponce De León
SHStefan Haar
Stefan Haar
DLDelphine Longuet
Delphine Longuet