Olivier Roux

Prof. Olivier Roux


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
8 May 2012 in Mathematical Structures in Computer Science
Verified
Journal Article
Closed access
PDF file
LPLoïc Paulevé
Loïc Paulevé
MMMorgan Magnin
Morgan Magnin
OROlivier Roux
Olivier Roux
The analysis of the dynamics of Biological Regulatory Networks (BRNs) requires innovative methods to cope with the state-space explosion. This paper settles an original approach for deciding reachability properties based onProcess Hitting, which is a framework suitable for modelling dynamical complex systems. In particular, Process Hitting has been shown to be of interest in providing compact models of the dynamics of BRNs with discrete values. Process Hitting splits a finite number of processes into so-called sorts and describes the way each process is able to act upon (that is, to ‘hit’) another one (or itself) in order to ‘bounce’ it as another process of the same sort with further actions.By using complementary abstract interpretations of the succession of actions in Process Hitting, we build a very efficient static analysis to over- and under-approximate reachability properties, which avoids the need to build the underlying states graph. The analysis is proved to have a low theoretical complexity, in particular when the number of processes per sorts is limited, while a very large number of sorts can be managed.This makes such an approach very promising for the scalable analysis of abstract complex systems. We illustrate this through the analysis of a large BRN of 94 components. Our method replies quasi-instantaneously to reachability questions, while standard model-checking techniques regularly fail because of the combinatoric explosion of behaviours.

1 January 2006 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
GGGuillaume Gardey
Guillaume Gardey
OROlivier Roux
Olivier Roux
The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove the algorithm to be exact with respect to the reachability problem. Furthermore, we propose a translation of the computed state space into a Timed Automaton, proved to be timed bisimilar to the original Time Petri Net. As the method produce a single Timed Automaton, syntactical clocks reduction methods (DAWS and YOVINE for instance) may be applied to produce an automaton with fewer clocks. Then, our method allows to model-check T-TPN by the use of efficient Timed Automata tools.

4 June 2010 in BMC Systems Biology
Verified
Journal Article
Open access
PDF file
JFJonathan Fromentin
Jonathan Fromentin
DEdamien eveillard
damien eveillard
OROlivier Roux
Olivier Roux
Modeling a dynamical biological system is often a difficult task since the a priori unknown parameters of such models are not always directly given by the experiments. Despite the lack of experimental quantitative knowledge, one can see a dynamical biological system as (i) the combined evolution tendencies (increase or decrease) of the biological compound concentrations, and: (ii) the temporal features, such as delays between two concentration peaks (i.e. the times when one of the components completes an increase (resp. decrease) phase and starts a decrease (resp. increase) phase).

1 April 2019 in Theoretical Computer Science
Verified
Journal Article
Closed access
GBG. Bernot
G. Bernot
JCJean-Paul Comet
Jean-Paul Comet
ZKZ. Khalis
Z. Khalis
ARA. Richard
A. Richard
OROlivier Roux
Olivier Roux

1 August 2007 in 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)
Verified
Conference Paper
Closed access
JFJonathan Fromentin
Jonathan Fromentin
JCJean-Paul Comet
Jean-Paul Comet
PGPascale Le Gall
Pascale Le Gall
OROlivier Roux
Olivier Roux
In this article, we propose a formal method to analyse gene regulatory networks (GRN). The dynamics of such systems is often described by an ordinary differential equation system, but has also been abstracted into a discrete transition system. This modeling depends on parameters for which different values are possible. Each instantiation of these parameters defines a possible dynamics and verification tools can be used to select the tuples of values which lead to dynamics consistent with known behaviours. GRN are so complex that their discrete modeling gives a number of possible dynamics exponential in function of the GRN's size (number of genes and interactions). In this paper, we propose to use constraint programming and CTL formal language to determine the set of all dynamics consistent with the known behavioral properties without enumerating all of them. This approach allows us therefore to minimize the computation time necessary for the research of these parameters.

9 January 2017 in Algorithms
Verified
Journal Article
Open access
PDF file
EAEmna Ben Abdallah
Emna Ben Abdallah
TRTony Ribeiro
Tony Ribeiro
MMMorgan Magnin
Morgan Magnin
OROlivier Roux
Olivier Roux
KIKatsumi Inoue
Katsumi Inoue
Background: The modeling of Biological Regulatory Networks (BRNs) relies on background knowledge, deriving either from literature and/or the analysis of biological observations. However, with the development of high-throughput data, there is a growing need for methods that automatically generate admissible models. Methods: Our research aim is to provide a logical approach to infer BRNs based on given time series data and known influences among genes. Results: We propose a new methodology for models expressed through a timed extension of the automata networks (well suited for biological systems). The main purpose is to have a resulting network as consistent as possible with the observed datasets. Conclusion: The originality of our work is three-fold: (i) identifying the sign of the interaction; (ii) the direct integration of quantitative time delays in the learning approach; and (iii) the identification of the qualitative discrete levels that lead to the systems’ dynamics. We show the benefits of such an automatic approach on dynamical biological models, the DREAM4(in silico) and DREAM8 (breast cancer) datasets, popular reverse-engineering challenges, in order to discuss the precision and the computational performances of our modeling method.