Dans le cadre du séminaire du MeFoSyLoMA, Loïc Paulevé, CR CNRS du LaBRI viendra nous présenter ses travaux de recherche le 22 mars 14h en petit amphi, site IBGBI.
Les titre et résumé de sa présentation sont fournies ci-après :
Titre : Reconciling qualitative and abstract (and scalable) reasoning with Boolean networks
Résumé : the dynamics of Boolean networks (BNs) is usually computed according to a fixed update mode (synchronous, asynchronous, etc.). However, update modes can miss important behaviours actually realisable in more concrete multilevel or quantitative models. We introduce the most permissive semantics of BNs which guarantees a correct over-approximation of behaviours of any multilevel refinement. Moreover, it turns out that analysing the most permissive dynamics of BNs is much simpler than with update modes: reachability is PTIME (instead of PSPACE-complete), and identifying attractors is NP (instead of PSPACE-complete). Therefore, computing reachable attractors become tractable to very large networks, without any assumption on their structure. We conclude on the impact for learning networks from time series data.
- Date: 22/03/2019, 14h
- Lieu: IBISC, site IBGBI, petit amphi
- Invitant: Sergiu Ivanov (MCF Univ. Evry), équipe COSMO
