BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SUMMARY:
Model completion and dynamical analysis methods on biologica
l regulatory networks : a summary of my works
STATUS:CONFIRMED
ATTENDEE;CN="Maxime Folschette
":
MAILTO:no@spam.com
DESCRIPTION:
In order to avoid the inherent complexity of differential eq
uation systems\, Kauffman (1969) and Thomas (1973) built the
basis of a discrete modeling relying on graphs\, and which
dynamics is a restriction of synchronous automata networks\,
while ensuring a consistence with the biological systems mo
deled. New problems then arise such as the automation of the
process of creating such discrete or hybrid models\, and th
e analysis of their dynamics. During this talk\, after a rem
inder of the classical Thomas modeling\, which is the basis
of my works\, I will present the two main aspects of my rese
arch. * First\, model completion consists in inferring the m
issing topology or parameters of a model. - A first approach
consisted in using a modified Hoare logic in order to find
the value of some dynamical parameters in a hybrid context ;
for this\, a dynamical biological behavior found in the lit
erature can be expressed as an imperative program and submit
ted to a weakest precondition calculus\, Ã la Dijkstra. - A
nother more recent and experimental approach consists in rec
onstructing the topology of a networks (especially all the i
nfluences between components) by exploiting directly express
ion data\, contrary to existing methods that require a discr
etization phase beforehand. * The second aspect is the analy
sis of the dynamics of such a complex system. - Analysis wit
h Answer Set Programming (ASP) which is a recent logic progr
amming paradigm for which powerful solvers exist : they show
good performances on several classical problems : state rea
chability\, fixed points enumeration and complex attractors
enumeration. - Analysis with Âµ-calculus\, which is an exten
sion of classical temporal logic CTL* : being more expressiv
e\, it allows for instance to search for attractors of disru
ptions\, or check models bisimulation. - Analysis by static
analysis with abstract interpretation : this approach\, on t
he other hand\, focuses on a single property (here\, reachab
ility) but considerably drops the complexity\, allowing to o
btain results on big models in very little time.
DTSTART;TZID=Europe/Paris:20180213T110000
DURATION:PT1H
URL;VALUE=URI:http://www.lsv.ens-cachan.fr/Seminaires/?sem=201802131
100
UID:LSVsemLSV.201802131100@lsv.ens-cachan.fr
LOCATION:Salle de Conférence (Pavillon des Jardins)
END:VEVENT
END:VCALENDAR